On the maximum number of copies of H in graphs with given size and order

2018/10/01 by Gerbner, Dániel, Nagy, Dániel T., Patkós, Balázs +1
#05C35 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1810.00817

Abstract

We study the maximum number ex(n,e,H) of copies of a graph H in graphs with given number of vertices and edges. We show that for any fixed graph H, ex(n,e,H) is asymptotically realized by the quasi-clique provided that the edge density is sufficiently large. We also investigate a variant of this problem, when the host graph is bipartite.

Related

• On a Conjecture of Nagy on Extremal Densities
• Many T copies in H-free graphs
• Ordered and colored subgraph density problems
• The maximum number of cliques in disjoint copies of graphs
• On the extremal number of subdivisions