On large induced trees and long induced paths in sparse random graphs
By analyzing an algorithm for finding the induced trees in a graph, probabilistic bounds are obtained on the order of the largest induced tree in a sparse random graph. Similar results on the length of the longest induced path are obtained by considering the path joining the root of an induced tree to a leaf.
scientific article; zbMATH DE number 130558