A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Packing Loose Hamilton Cycles
[article]

2016
*
arXiv
*
pre-print

A subset C of edges in a k-uniform hypergraph H is a loose Hamilton cycle if C covers all the vertices of H and there exists a cyclic ordering of these vertices such that the edges in C are segments of that order and such that every two consecutive edges share exactly one vertex. The binomial random k-uniform hypergraph H^k_n,p has vertex set [n] and an edge set E obtained by adding each k-tuple e∈[n]k to E with probability p, independently at random. Here we consider the problem of finding

arXiv:1608.01278v1
fatcat:ew37ldog5zfozjzpkdaa5ydjei