English

Minimum degree conditions for Hamilton $l$-cycles in $ k $-uniform hypergraphs

Combinatorics 2025-03-11 v1

Abstract

We show that for η>0 \eta>0 and sufficiently large n n , every 5-graph on n n vertices with δ2(H)(91/216+η)(n3)\delta_{2}(H)\ge (91/216+\eta)\binom{n}{3} contains a Hamilton 2-cycle. This minimum 2-degree condition is asymptotically best possible. Moreover, we give some related results on Hamilton \ell -cycles with d d -degree for dk1\ell\le d \le k-1 and 1<k/21\le \ell < k/2.

Keywords

Cite

@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}
}
R2 v1 2026-06-28T22:10:31.062Z