Sharp thresholds for higher powers of Hamilton cycles in random graphs

Tamás Makai, Matija Pasch, Kalina Petrova +1

For $k\ge 4$, we establish that $p=(e/n{)}^{1/k}$ is a sharp threshold for the existence of the $k$-th power $H$ of a Hamilton cycle in the binomial random graph model. Our proof…