On the maximum number of copies of H in graphs with given size and order |
| |
Authors: | Dniel Gerbner Dniel T Nagy Balzs Patks Mt Vizer |
| |
Institution: | Dániel Gerbner,Dániel T. Nagy,Balázs Patkós,Máté Vizer |
| |
Abstract: | We study the maximum number of copies of a graph in graphs with a given number of vertices and edges. We show that for any fixed graph 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. |
| |
Keywords: | bipartite graph extremal graph theory number of subgraphs quasi‐clique |
|
|