On the maximum number of copies of H in graphs with given size and order
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.