Date
Tue, 24 Nov 2015
14:30
Location
L6
Speaker
Jie Han
Organisation
University of Birmingham

Cycles are fundamental objects in graph theory. A spanning cycle in a graph is also called a Hamiltonian cycle. The celebrated Dirac's Theorem in 1952 shows that every graph on $n\ge 3$ vertices with minimum degree at least $n/2$ contains a Hamiltonian cycle. In recent years, there has been a strong focus on extending Dirac’s Theorem to hypergraphs. We survey the results along the line and mention some recent progress on this problem. Joint work with Yi Zhao.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 14:57.