Tight Hamilton Cycles in Random Uniform Hypergraphs

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles.Comment: 9 pages. Updated to add materia

The threshold for powers of tight Hamilton cycles in random hypergraphs

We investigate the occurrence of powers of tight Hamilton cycles in random hypergraphs. For every $r\ge 3$ and $k\ge 1$, we show that there exists a constant $C > 0$ such that if $p=p(n) \ge Cn^{-1/\binom{k+r-2}{r-1}}$ then asymptotically almost surely the random hypergraph $H^{(r)}(n,p)$ contains the $k$th power of a tight Hamilton cycle. This improves on a result of Parczyk and Person, who proved the same result under the assumption $p=\omega\left(n^{-1/\binom{k+r-2}{r-1}}\right)$ using a second moment argument