Speaker: Lai Hongjian, Tenured Professor and Doctoral Supervisor, West Virginia University, USA

Inviter: Yan Jin, Professor, School of Mathematics, Shandong University

Date: Jan.7, 2021

Time: 9:00- 10:00a.m.

Location: Tencent Meeting ID:730 753 656

Abstract:

The well-known Chvátal-Erdős Theorem on Hamiltoniangraphs states that if the stability number a(G) and the connectivity k(G) satisfy the conditionk(G)>a(G)+s,where s{-1,0,1} then G has a Hamilton path if s=-1, a Hamilton cycle ifs=0 and G is Hamilton-connected ifs=1.There have been many efforts to generalize the Chvátal-Erdős Conditions and similar conditions in graph theory. We will present some of these extensions. In particular, we will share the ideas of our effort to extend the Chvátal-Erdős Theorems within the family of all line graphs.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/144989.htm