The largest hole in sparse random graphs

We show that for any $d=d(n)$ with $d_0(epsilon) le d =o(n)$, with high probability, the size of a largest induced cycle in the random graph $G(n,d/n)$ is $(2pm epsilon)frac{n}{d}log d$. This settles a long-standing open problem in random graph theory.