Title：An approximate Ore-type theorem for $\ell$-Hamilton cycles in uniform hypergraphs

Abstract：A classic result of Ore states that if the degree sum of any two independent vertices in an n-vertex graph is at least n, then the graph contains a Hamiltonian cycle. In this talk, we consider the generation of the Ore’s theorem to $\ell$-Hamilton cycles in k-uniform hypergraphs. The key idea is a modification of the absorbing lemma.

Speaker：Tai-jiang Jiang, Ph.D., Guizhou University. His research interests include the Hamilton decomposition of hypergraph and the Diractheorem of Hypergraph. He published several articles in《Discrete Applied Mathematics》,《Discrete Mathematics》.  

Date：19:00-21:00  2022-11-19 (Saturday).

Tencent Meeting ID：792 988 491

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.