Academic Report of School of Mathematical Sciences [2025] No. 115

(Series Report for High-Level University Construction No. 1217)

Title: How does a necessary condition effect a graph to have Hamiltonian properties?

Speaker: Professor Xiong Liming (Beijing Institute of Technology)

Time: 16:00-17:00, November 11, 2025 (Tuesday)

Location: Huixing Building Room 501

Abstract:

If a graph has Property A, it implies that G has Property B, then B is a necessary condition for G to have A. There exists some property for G to have it such that it is the same even we impose a necessary condition on it, while there exists some property for a graph to have it such that it is different if one imposes a necessary condition on it. For example, to be 2-connected is a necessary condition for a graph to be hamiltonian. In this talk, we update some recent results to show how a necessary condition affects a graph to have hamiltonian properties.

Speaker Profile:

Xiong Liming is a Professor and Doctoral Supervisor at the School of Mathematics and Statistics, Beijing Institute of Technology. He currently serves as a Council Member of the Graph Theory and Combinatorics Branch of the Chinese Operations Research Society, and is an editorial board member for journals including Open Journal of Discrete Mathematics. He was appointed as a part-time Distinguished Professor (2011-2014) under the inaugural 'Kunlun Scholar' program of Qinghai Province at Qinghai Nationalities University. He has presided over five General Projects of the National Natural Science Foundation of China and one project from the Ministry of Education's Returned Overseas Scholar Fund, and participated as a key member in one Key Project of the National Natural Science Foundation of China. He has published or had accepted over 140 academic papers in journals such as Journal of Combinatorial Theory Series B, Journal of Graph Theory, and Discrete Mathematics, of which more than 110 are SCI-indexed. His research focuses on structural graph theory, including Hamiltonian cycles, Hamiltonian paths, factor existence and extremal problems, Hamiltonicity indices, forbidden subgraphs, and algorithmic complexity. He has produced numerous outstanding research results, particularly in the areas of claw-free graphs and line graphs.

All faculty and students are welcome!

Host: Huang Zejun

School of Mathematical Sciences

November 10, 2025