Maximum induced trees in sparse random graphs

We prove that for any $\varepsilon>0$ and $n^{-(e-2)/(3e-2)+\varepsilon}\le p = o(1)$ the maximum size of an induced subtree of the binomial random graph $G{n,p}$ is concentrated in 2 consecutive points.