Large induced trees in dense random graphs

2020/04/06 by Draganić, Nemanja · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2004.02800

Abstract

Erdős and Palka initiated the study of the maximal size of induced trees in random graphs in 1983. They proved that for every fixed 0

Cited by

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

Related

• Maximum induced forests in random graphs
• Induced forests in regular graphs with large girth
• Maximum induced trees and forests of bounded degree in random graphs
• The maximum size of an induced forest in the binomial random graph
• Concentration of the maximum size of an induced subtree in moderately sparse random graphs