Loose Hamilton cycles in random uniform hypergraphs (Q540025): Difference between revisions

Summary: In the random \(k\)-uniform hypergraph \(H_{n,p;k}\) of order \(n\) each possible \(k\)-tuple appears independently with probability \(p\). A loose Hamilton cycle is a cycle of order \(n\) in which every pair of adjacent edges intersects in a single vertex. We prove that if \(pn^{k - 1}/ \log n\) tends to infinity with \(n\) then \(\lim_{n\to\infty } Pr(H_{n,p;k} \text{ contains a loose Hamilton cycle}) = 1\). This is asymptotically best possible.