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

الأصل · EN

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