Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
Abstract
We show that every 3-uniform hypergraph with n vertices and minimum vertex degree at least (5/9+o(1))n2 contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.