Concentration of the maximum size of an induced subtree in moderately sparse random graphs

Kamaldinov, Skorkin, and Zhukovskii proved that the maximum size of an induced subtree in the binomial random graph $G(n,p)$ is concentrated at two consecutive points, whenever $p\in (0,1)$ is a constant. Using improved bounds on the second moment of the number of induced subtrees, we show that the same result holds when $n^{-\frac{e-2}{3e-2}+\epsilon }\le p=o(1)$.