Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2

We prove for all $k\ge 4$ and $1\le \ell <k/2$ the sharp minimum $(k-2)$-degree bound for a $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices to contain a Hamiltonian $\ell$-cycl…