2024/03/21 by Richard Lang, Lang, Richard, Mathias Schacht +3
Mathematics · #Geometric and Algebraic Topology #Advanced Operator Algebra Research #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2403.14518
We show that for all k≥ 4, ε >0, and n sufficiently large, every k-uniform hypergraph on n vertices in which each set of k-3 vertices is contained in at least (5/8 + ε) \binomn3 edges contains a tight Hamilton cycle. This is asymptotically best possible.