Hamiltonian paths and cycles in some 4-uniform hypergraphs

Guanwu Liu, Xiaonan Liu

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$…