paper

Minimum degree conditions for Hamilton -cycles in -uniform hypergraphs

arXiv:2503.05275 · doi:10.37236/12143

Abstract

We show that for and sufficiently large , every 5-graph on vertices with contains a Hamilton 2-cycle. This minimum 2-degree condition is asymptotically best possible. Moreover, we give some related results on Hamilton -cycles with -degree for and .