We show that for η>0 and sufficiently large n, every 5-graph on n vertices with δ2(H)≥(91/216+η)(3n) contains a Hamilton 2-cycle. This minimum 2-degree condition is asymptotically best possible. Moreover, we give some related results on Hamilton ℓ-cycles with d-degree for ℓ≤d≤k−1 and 1≤ℓ<k/2.
@article{arxiv.2503.05275,
title = {Minimum degree conditions for Hamilton $l$-cycles in $ k $-uniform hypergraphs},
author = {Jie Han and Lin Sun and Guanghui Wang},
journal= {arXiv preprint arXiv:2503.05275},
year = {2025}
}