Hitting time for loose Hamilton cycles in the random hypergraph process
The random hypergraph process starts with an empty hypergraph on $n$ vertices and adds a uniformly chosen missing edge at each step. For even $n$, we prove that, with high probability, a $3$-uniform loose Hamilton cycle appears when the last isolated vertex disappears. The approach developed here adapts arguments from...