Stability version of Erd?s' theorem on nonhamiltonian graphs and related topics

报告题目:Stability version of Erdös' theorem on nonhamiltonian graphs and related topics

 报  告  人:宁  博    老师

 报告时间:2017年5月19日(星期五)下午15:00

 报告地点:6教811数学院学术报告厅


 报告摘要:

 

In 1962, generalizing Ore's theorem on Hamilton cycles, Erdös proved the following theorem: For a graph G with n vertices and δ(G)≥k, where 1 k(n-1)/2, if

then G is Hamiltonian.

Recently, Li and Ning (2016), and independently, Füredi, Kostochka and Luo (2017) proved the stability version of Erdös’ theorem on nonhamiltonian graphs. In this talk, we will report these results. Furthermore, we will introduce some related topics, such as Erdös-Gallai theorem, Woodall's theorem, Fan's theorem and the recent Füredi-Kostochka-Verstraëte theorem on cycles.



 报告人介绍:

 宁博,现任天津大学应用数学中心讲师。研究方向为图的结构理论,谱图理论。已发表或录用SCI期刊论文20余篇。一些重要结果被国际数学家大会45分钟报告人Zoltán Füredi等著名数学家多次引用。