Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs

作者：Han Jie^*; Zhao Yi

来源：Journal of Combinatorial Theory - Series A, 2015, 132: 194-223.

DOI：10.1016/j.jcta.2015.01.004

• Hamilton cycle
• Hypergraph
• Absorbing method
• Regularity lemma

For 1 <= l <= k/2, we show that for sufficiently large n, every k-uniform hypergraph on n vertices with minimum codegree at least n/2(k-l) contains a Hamilton l-cycle. This codegree condition is best possible and improves on work of Han and Schacht who proved an asymptotic result.

• 出版日期2015-5