On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle, or (ii) without an oriented triangle. We give an answer to these questions (which is not quite the predicted one). Our approach is based on the recent `hypergraph containers' method, developed independently by Saxton and Thomason as well as by Balogh, Morris and Samotij. Moreover, our results generalise to forbidden transitive tournaments and forbidden oriented cycles of any order, and also apply to digraphs. Along the way we prove several stability results for extremal digraph problems, which we believe are of independent interest.

[1]  N. Alon,et al.  The Number Of Orientations Having No Fixed Tournament , 2006, Comb..

[2]  József Balogh,et al.  Almost all triangle-free triple systems are tripartite , 2012, Comb..

[3]  Miklós Simonovits,et al.  The typical structure of graphs without given excluded subgraphs , 2009, Random Struct. Algorithms.

[4]  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..

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

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

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

[8]  Miklós Simonovits,et al.  Supersaturated graphs and hypergraphs , 1983, Comb..

[9]  R. Lathe.  Phd by thesis , 1988, Nature.

[10]  Hans Jürgen Prömel,et al.  The asymptotic number of graphs not containing a fixed color-critical subgraph , 1992, Comb..

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

[12]  Miklós Simonovits,et al.  The fine structure of octahedron-free graphs , 2011, J. Comb. Theory, Ser. B.

[13]  Paul D. Seymour,et al.  Cycles in dense digraphs , 2008, Comb..

[14]  Mathias Schacht,et al.  Almost all hypergraphs without Fano planes are bipartite , 2009, SODA.

[15]  Carsten Thomassen,et al.  On pancyclic digraphs , 1976 .

[16]  Richard P. Stanley.  Acyclic orientations of graphs , 1973, Discret. Math..

[17]  G. Cherlin,et al.  The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments , 1998 .

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

[19]  Miklós Simonovits,et al.  The number of graphs without forbidden subgraphs , 2004, J. Comb. Theory B.

[20]  Béla Bollobás,et al.  Hereditary Properties of Tournaments , 2007, Electron. J. Comb..

[21]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2003, STOC '03.

[22]  Wojciech Samotij,et al.  The number of Ks,t‐free graphs , 2011, J. Lond. Math. Soc..

[23]  Béla Bollobás,et al.  Hereditary properties of combinatorial structures: Posets and oriented graphs , 2007, J. Graph Theory.

[24]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[25]  David Saxton,et al.  The number of $C_{2l}$-free graphs , 2013, 1309.2927.

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

[27]  J. Balogh,et al.  Independent sets in hypergraphs , 2012, 1204.6530.

[28]  Andrew Thomason,et al.  Simple Containers for Simple Hypergraphs , 2014, Combinatorics, Probability and Computing.

[29]  Reinhard Diestel,et al.  Graph Theory , 1997 .