Many H-Copies in Graphs with a Forbidden Tree

For graphs $H$ and $F$, let $\operatorname{ex}(n, H, F)$ be the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices. The study of this function, which generalises the well-studied Tur\'an numbers of graphs, was initiated recently by Alon and Shikhelman. We show that if $F$ is a tree then $\operatorname{ex}(n, H, F) = \Theta(n^r)$ for some integer $r = r(H, F)$, thus answering one of their questions.

[1]  D'aniel Gerbner,et al.  Generalized Turán problems for disjoint copies of graphs , 2017, Discret. Math..

[2]  Andrzej Grzesik,et al.  On the maximum number of odd cycles in graphs without smaller odd cycles , 2022, J. Graph Theory.

[3]  Jan Hladký,et al.  On the number of pentagons in triangle-free graphs , 2013, J. Comb. Theory, Ser. A.

[4]  Hao Li,et al.  The Maximum Number of Triangles in C2k+1-Free Graphs , 2012, Combinatorics, Probability and Computing.

[5]  David Galvin,et al.  Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree , 2014, J. Graph Theory.

[6]  Asaf Shapira,et al.  A Generalized Tur\'an Problem and its Applications , 2017, 1712.00831.

[7]  Ervin Györi,et al.  A note on the maximum number of triangles in a C5-free graph , 2019, J. Graph Theory.

[8]  Noga Alon,et al.  Many T copies in H-free graphs , 2014, Electron. Notes Discret. Math..

[9]  Jie Ma,et al.  Some sharp results on the generalized Turán numbers , 2018, Eur. J. Comb..

[10]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[11]  J. Sheehan,et al.  On the number of complete subgraphs contained in certain graphs , 1981, J. Comb. Theory, Ser. B.

[12]  Cory Palmer,et al.  Counting copies of a fixed subgraph in F-free graphs , 2018, Eur. J. Comb..

[13]  Miklós Simonovits,et al.  Paul Erdős' Influence on Extremal Graph Theory , 2013, The Mathematics of Paul Erdős II.

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Casey Tompkins,et al.  The maximum number of $P_\ell$ copies in $P_k$-free graphs , 2018 .

[16]  Jian Wang,et al.  The shifting method and generalized Turán number of matchings , 2018, Eur. J. Comb..

[17]  Andrzej Grzesik.  On the maximum number of five-cycles in a triangle-free graph , 2012, J. Comb. Theory, Ser. B.

[18]  Ruth Luo,et al.  The maximum number of cliques in graphs without long cycles , 2017, J. Comb. Theory B.

[19]  B. Bollobás.  On complete subgraphs of different orders , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  Benny Sudakov,et al.  Maximizing the Number of Independent Sets of a Fixed Size , 2015, Comb. Probab. Comput..

[21]  Ervin Györi,et al.  Generalized Turán problems for even cycles , 2017, J. Comb. Theory, Ser. B.