Decomposing hypergraphs into cycle factors

Felix Joos, Marcus Kühn, Bjarne Schülke

A famous result by Rödl, Ruciński, and Szemerédi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $δ_{k-1}(H)\geq (1/2…