Hamilton l-cycles in uniform hypergraphs

Daniela Kühn, Richard Mycroft, Deryk Osthus

We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that…