The maximum size of an induced forest in the binomial random graph

2023/10/13 by Akhmejanova, Margarita, Kozhevnikov, Vladislav · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2310.09416

Abstract

The celebrated Frieze's result about the independence number of G(n,p) states that it is concentrated in an interval of size o(1/p) for all C_ε/n

Cited by

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

Related

• Maximum induced forests in random graphs
• Maximum induced trees and forests of bounded degree in random graphs
• Concentration of the maximum size of an induced subtree in moderately sparse random graphs
• Maximum sparse induced subgraphs of the binomial random graph with given\n number of edges
• Large induced trees in dense random graphs