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 + ε) n3 edges contains a tight Hamilton cycle. This is asymptotically best possible.
No takes yet. Share an insight, caveat, or question.
Lang et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: