Minimum degree conditions for Hamilton l-cycles in k -uniform hypergraphs
Abstract
We show that for η>0 and sufficiently large n , every 5-graph on n vertices with δ2(H) (91/216+η)n3 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.