Key points are not available for this paper at this time.
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.
Lang et al. (Thu,) studied this question.