A Chvátal-type codegree condition for Hamiltonian cycles in $k$-uniform hypergraphs

Abstract

We prove an asymptotic Chvátal-type codegree criterion for tight Hamiltonian cycles in $k$-uniform hypergraphs for every fixed $k\ge 3$. The criterion allows small degrees to be compensated by large degrees in the link graphs of $(k-2)$-tuples. It strengthens the asymptotic Dirac-type theorem by Rödl, Ruciński and Szemerédi and implies a Pósa-type criterion conjectured by Schülke.

12 pages