On the codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs

Abstract

In this note, we resolve the remaining open case of a conjecture by Han and Zhao concerning the codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs. Specifically, we prove that for integers $k\ge 3$, $3k/4\le \ell <k$, with $k\not\equiv 0(\mathrm{mod}k-\ell )$, and for all sufficiently large $n$ divisible by $k-\ell$, every $n$-vertex $k$-uniform hypergraph $H$ satisfying \[ δ_{k-1}(H)\ge \frac{n}{(k-\ell)\left\lceil \frac{k}{k-\ell}\right\rceil} \] contains a Hamilton $\ell$-cycle. Our proof builds on the framework of Gan, Han and Xu, and refines their argument to obtain, at the exact threshold, the required family of paths.

8 pages