Induced trees in sparse random graphs (Q1086255)

The paper contains the constructive proof of the theorem: If \(c>1\) the random graph G(n,p) on n vertices with edge probability \(p=c/n\) almost surely contains an induced tree on at least \(n\alpha_ c(1-0(1))\) vertices where \(\alpha_ c\) is the positive root of the equation \(c\alpha =\log (1+c^ 2\alpha)\).