A Generalized Tur\'an Problem and its Applications

The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ${\ell}$ and $k$, how many copies of the $k$-cycle guarantee the appearance of an $\ell$-cycle? Extending previous results of Bollob\'as--Gy\H{o}ri--Li and Alon--Shikhelman, we fully resolve this problem by giving tight (or nearly tight) bounds for all values of $\ell$ and $k$. We also present a somewhat surprising application of the above mentioned estimates to the study of the graph removal lemma. Prior to this work, all bounds for removal lemmas were either polynomial or there was a tower-type gap between the best known upper and lower bounds. We fill this gap by showing that for every super-polynomial function $f(\varepsilon)$, there is a family of graphs ${\cal F}$, such that the bounds for the ${\cal F}$ removal lemma are precisely given by $f(\varepsilon)$. We thus obtain the first examples of removal lemmas with tight super-polynomial bounds. A special case of this result resolves a problem of Alon and the second author, while another special case partially resolves a problem of Goldreich.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[2]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[3]  J. Maynard.  On the difference between consecutive primes , 2012, 1201.1787.

[4]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[5]  Asaf Shapira,et al.  Removal lemmas with polynomial bounds , 2016, STOC.

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

[7]  Noga Alon,et al.  Every monotone graph property is testable , 2005, STOC '05.

[8]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[9]  P. Erdös.  Problems and Results on Graphs and Hypergraphs: Similarities and Differences , 1990 .

[10]  Oded Goldreich,et al.  Contemplations on Testing Graph Properties , 2005, Sublinear Algorithms.

[11]  V. Rödl,et al.  On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..

[12]  Noga Alon,et al.  A separation theorem in property testing , 2008, Comb..

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

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

[15]  David Conlon,et al.  Graph removal lemmas , 2012, Surveys in Combinatorics.

[16]  Jacques Verstraëte.  Extremal problems for cycles in graphs , 2016 .

[17]  Noga Alon,et al.  Random sampling and approximation of MAX-CSP problems , 2002, STOC '02.

[18]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[19]  Miklós Simonovits,et al.  Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions , 1974, Discret. Math..

[20]  C. T. Benson.  Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.

[21]  Noga Alon,et al.  Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[22]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[23]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[24]  Paul Erdös,et al.  Some problems in graph theory , 1974 .

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

[26]  Noga Alon,et al.  Easily Testable Graph Properties , 2015, Combinatorics, Probability and Computing.

[27]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[28]  J. Pintz,et al.  The Difference Between Consecutive Primes, II , 2001 .

[29]  Jacob Fox,et al.  A new proof of the graph removal lemma , 2010, ArXiv.

[30]  Christian Sohler.  Almost Optimal Canonical Property Testers for Satisfiability , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

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

[33]  Rephael Wenger,et al.  Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.

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

[35]  Jacques Verstraëte,et al.  A Note on Bipartite Graphs Without 2k-Cycles , 2005, Combinatorics, Probability and Computing.

[36]  János Komlós.  Covering odd cycles , 1997, Comb..