Graphs with many copies of a given subgraph


Let c > O, and H be a fixed graph of order r. Every graph on n vertices containing at least Cnr copies of H contains a "blow-up" of H with r - 1 vertex classes of size ⌊cr2lnn⌋ and one vertex class of size greater than n1-cr-1. A similar result holds for induced copies of H.

Publication Title

Electronic Journal of Combinatorics