2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Jakob Hofstad
Let T(G) be the size of the largest induced tree of G, and let Gn,p be the binomial random graph. Kamaldinov, Skorkin, and Zhukovskii proved that T(Gn,p) equals one o…