Packing Tight Hamilton Cycles in Uniform Hypergraphs
We say that a k-uniform hypergraph C is a Hamilton cycle of type l, for some 1 ≤ l ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices, and for every pair of consecutive edges E i-1\E i in C (in the natural ordering of the edges) we have |E i-1 \ E i| = l. We define a class of (ε, p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type l Hamilton cycles, where l < k/2.
MSU Digital Commons Citation
Bal, Deepak and Frieze, Alan, "Packing Tight Hamilton Cycles in Uniform Hypergraphs" (2012). Department of Mathematics Facuty Scholarship and Creative Works. 134.