Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

For a given graph $F$ we consider the family of (finite) graphs $G$ with the Ramsey property for $F$, that is the set of such graphs $G$ with the property that every two-colouring of the edges of $G$ yields a monochromatic copy of $F$. For $F$ being a triangle Friedgut, R\"odl, Ruci\'nski, and Tetali (2004) established the sharp threshold for the Ramsey property in random graphs. We obtained a simpler proof of this result which extends to a more general class of graphs $F$ including all cycles. The proof is based on Friedgut's criteria (1999) for sharp thresholds, and on the recently developed container method for independent sets in hypergraphs by Saxton and Thomason, and Balogh, Morris and Samotij. The proof builds on some recent work of Friedgut et al. who established a similar result for van der Waerden's theorem.

[1]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Joel H. Spencer,et al.  Counting extensions , 1990, J. Comb. Theory, Ser. A.

[3]  M. Schacht,et al.  A sharp threshold for van der Waerden's theorem in random subsets , 2016 .

[4]  W. T. Gowers,et al.  On the KŁR conjecture in random graphs , 2013, 1305.2516.

[5]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

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

[7]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[8]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[9]  Vojtech Rödl,et al.  Quantitative theorems for regular systems of equations , 1988, J. Comb. Theory, Ser. A.

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  M. Schacht.  Extremal results for random discrete structures , 2016, 1603.00894.

[12]  Svante Janson,et al.  Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.

[13]  M. Simonovits,et al.  Cube-Supersaturated Graphs and Related Problems , 1982 .

[14]  V. Rödl,et al.  Ramsey properties of random discrete structures , 2010 .

[15]  W. T. Gowers,et al.  Combinatorial theorems in sparse random sets , 2010, 1011.4310.

[16]  Y. Kohayakawa.  Szemerédi's regularity lemma for sparse graphs , 1997 .

[17]  W. Samotij,et al.  Independent sets in hypergraphs , 2012, 1204.6530.

[18]  Michael Krivelevich,et al.  Sharp thresholds for certain Ramsey properties of random graphs , 2000, Random Struct. Algorithms.

[19]  E. Friedgut.  Hunting for sharp thresholds , 2005 .

[20]  Vojtech Rödl,et al.  On Schur Properties of Random Subsets of Integers , 1996 .

[21]  V. Rödl,et al.  Threshold functions for Ramsey properties , 1995 .

[22]  Vojtech Rödl,et al.  A sharp threshold for random graphs with a monochromatic triangle in every edge coloring , 2006, Memoirs of the American Mathematical Society.

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