Some extremal problems for hereditary properties of graphs

2013/05/06 by Nikiforov, Vladimir
#05C35 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1305.1072

Abstract

This note answers extremal questions like: what is the maximum number of edges in a graph of order n, which belongs to some hereditary property. The same question is answered also for the spectral radius and other similar parameters.

Related

• An analytic theory of extremal hypergraph problems
• Subgraphs of random graphs in hereditary families
• Largest subgraph from a hereditary property in a random graph
• Spectral extremal results with forbidding linear forests
• Two spectral extremal results for graphs with given order and rank