On Hamiltonian cycles in hypergraphs with dense link graphs
Abstract
We show that every k-uniform hypergraph on n vertices whose minimum (k-2)-degree is at least (5/9+o(1))n2/2 contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The same result was proved independently by Lang and Sahueza-Matamala.
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.