A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Packing tight Hamilton cycles in 3-uniform hypergraphs
[chapter]
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
We say that a k-uniform hypergraph C is a Hamilton cycle of type , for some 1 ≤ ≤ 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 | = . 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 Hamilton cycles, where < k/2.
doi:10.1137/1.9781611973082.71
dblp:conf/soda/FriezeKL11
fatcat:hhuz554ebvevzdxhkdjylqm3yy