Tight Hamiltonicity from dense links of triples

Richard Lang, Mathias Schacht, Jan Volec

We show that for all $k\ge 4$, $\epsilon >0$, and $n$ sufficiently large, every $k$-uniform hypergraph on $n$ vertices in which each set of $k-3$ vertices is contained in at le…