Induced Turán Numbers

The classical Kővari–Sos–Turan theorem states that if G is an n -vertex graph with no copy of K s,t as a subgraph, then the number of edges in G is at most O ( n 2−1/ s ). We prove that if one forbids K s,t as an induced subgraph, and also forbids any fixed graph H as a (not necessarily induced) subgraph, the same asymptotic upper bound still holds, with different constant factors. This introduces a non-trivial angle from which to generalize Turan theory to induced forbidden subgraphs, which this paper explores. Along the way, we derive a non-trivial upper bound on the number of cliques of fixed order in a K r -free graph with no induced copy of K s,t . This result is an induced analogue of a recent theorem of Alon and Shikhelman and is of independent interest.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  P. Erdös On extremal problems of graphs and generalized graphs , 1964 .

[3]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[4]  József Solymosi,et al.  Large Cliques in -Free Graphs , 2002, Comb..

[5]  Béla Bollobás,et al.  The Speed of Hereditary Properties of Graphs , 2000, J. Comb. Theory B.

[6]  Zoltán Füredi,et al.  New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.

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

[8]  Linyuan Lu,et al.  Diamond-free families , 2010, J. Comb. Theory, Ser. A.

[9]  Zsolt Tuza,et al.  The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..

[10]  Christopher M. Hartman Extremal problems in graph theory , 1997 .

[11]  H. Prömel,et al.  Excluding Induced Subgraphs III: A General Asymptotic , 1992 .

[12]  E. Sperner Ein Satz über Untermengen einer endlichen Menge , 1928 .

[13]  Jennifer Ryan,et al.  Bounds on the number of complete subgraphs , 1992, Discret. Math..

[14]  P. Erdos,et al.  A LIMIT THEOREM IN GRAPH THEORY , 1966 .

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

[16]  T. D. Parsons The Ramsey numbers r(Pm, Kn) , 1973, Discret. Math..

[17]  N. Alon,et al.  Turán ’ s theorem in the hypercube , 2006 .

[18]  Linyuan Lu,et al.  Set families with forbidden subposets , 2014, J. Comb. Theory, Ser. A.

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

[20]  Béla Bollobás,et al.  Pentagons vs. triangles , 2008, Discret. Math..

[21]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[22]  Hans Jürgen Prömel,et al.  Excluding Induced Subgraphs II: Extremal Graphs , 1993, Discret. Appl. Math..

[23]  Béla Bollobás,et al.  Hereditary and Monotone Properties of Graphs , 2013, The Mathematics of Paul Erdős II.

[24]  Béla Bollobás,et al.  Extremal problems in graph theory , 1977, J. Graph Theory.

[25]  Vojtech Rödl,et al.  The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

[26]  Maria Chudnovsky,et al.  The Erdös–Hajnal Conjecture—A Survey , 2014, J. Graph Theory.

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

[28]  Douglas B. West,et al.  Large P4-free graphs with bounded degree , 1993, J. Graph Theory.

[29]  Benny Sudakov,et al.  Dependent random choice , 2009, Random Struct. Algorithms.

[30]  Tao Jiang,et al.  Set Families With a Forbidden Induced Subposet , 2012, Comb. Probab. Comput..

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

[32]  Alexander A. Razborov,et al.  On 3-Hypergraphs with Forbidden 4-Vertex Configurations , 2010, SIAM J. Discret. Math..

[33]  Ryan R. Martin,et al.  On diamond-free subposets of the Boolean lattice , 2013, J. Comb. Theory, Ser. A.

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

[35]  Miklós Simonovits,et al.  Compactness results in extremal graph theory , 1982, Comb..

[36]  P. Erdös,et al.  On the structure of linear graphs , 1946 .

[37]  Miklós Simonovits,et al.  Ramsey-Turán theory , 2001, Discret. Math..

[38]  Paul Erdös,et al.  Ramsey-type theorems , 1989, Discret. Appl. Math..

[39]  Hans Jürgen Prömel,et al.  Excluding Induced Subgraphs: Quadrilaterals , 1991, Random Struct. Algorithms.

[40]  Douglas B. West,et al.  Large 2P3-free graphs with bounded degree , 1996, Discret. Math..

[41]  M. Simonovits,et al.  The History of Degenerate (Bipartite) Extremal Graph Problems , 2013, 1306.5167.

[42]  Alexander Sidorenko,et al.  What we know and what we do not know about Turán numbers , 1995, Graphs Comb..

[43]  Cecil C. Rousseau,et al.  Asymptotic Upper Bounds for Ramsey Functions , 2001, Graphs Comb..

[44]  David Conlon On the Ramsey multiplicity of complete graphs , 2012, Comb..

[45]  Jean-Claude Bermond,et al.  Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .