Forbidding induced even cycles in a graph: Typical structure and counting

We determine, for all $k\geq 6$, the typical structure of graphs that do not contain an induced $2k$-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the typical structure of such graphs is richer than that encountered in related results. The approach we take also yields an approximate result on the typical structure of graphs without an induced $8$-cycle or without an induced $10$-cycle.

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

[2]  Bruce A. Reed,et al.  For most graphs H, most H‐free graphs have a linear homogeneous set , 2014, Random Struct. Algorithms.

[3]  Alexandr V. Kostochka,et al.  On independent sets in hypergraphs , 2011, Random Struct. Algorithms.

[4]  Noga Alon,et al.  A Characterization of the (Natural) Graph Properties Testable with One-Sided Error , 2008, SIAM J. Comput..

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

[6]  Béla Bollobás.  Surveys in Combinatorics 2007: Hereditary and monotone properties of combinatorial structures , 2007 .

[7]  Ph. G. Kolaitis,et al.  _{+1}-free graphs: asymptotic structure and a 0-1 law , 1987 .

[8]  Deryk Osthus,et al.  For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? , 2003, Comb..

[9]  Wojciech Samotij,et al.  The typical structure of sparse $K_{r+1}$-free graphs , 2013, 1307.5967.

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

[11]  alcun K. grafo.  ASYMPTOTIC ENUMERATION OF Kn-FREE GRAPHS , 2004 .

[12]  D. Saxton,et al.  Hypergraph containers , 2012, 1204.6595.

[13]  Hans Jürgen Prömel,et al.  Almost all Berge Graphs are Perfect , 1992, Comb. Probab. Comput..

[14]  Timothy Townsend.  Extremal problems on graphs, directed graphs and hypergraphs , 2016 .

[15]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[16]  Jane Butterfield,et al.  Excluding induced subgraphs: Critical graphs , 2011, Random Struct. Algorithms.

[17]  I. Elldős.  ON SOME NEW INEQUALITIES CONCERNING EXTREMAL PROPERTIES OF GRAPHS by , 2004 .

[18]  Yi Zhao,et al.  On the structure of oriented graphs and digraphs with forbidden tournaments or cycles , 2014, J. Comb. Theory, Ser. B.

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

[20]  Noga Alon,et al.  The structure of almost all graphs in a hereditary property , 2009, J. Comb. Theory B.

[21]  N. D. Bruijn.  Asymptotic methods in analysis , 1958 .