Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

DOI10.1002/RSA.20723MaRDI QIDQ4601439zbMATH OpenOpenAlexFDO

Authors M. Schacht, F. Schulenburg

Publication date 16 January 2018

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.02501

zbMATH Keywords

cyclesRamsey's theoremsharp thresholds

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Abstract: 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.

Recommendations

• Sharp thresholds for certain Ramsey properties of random graphs
• Ramsey games near the critical threshold
• Ramsey properties of random graphs and folkman numbers
• Threshold Functions for Ramsey Properties
• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring

Cited in

(10)

• Symmetric and asymmetric Ramsey properties in random hypergraphs
• Counting extensions revisited
• A short proof of the random Ramsey theorem
• Ramsey games near the critical threshold
• A sharp threshold for van der Waerden's theorem in random subsets
• Ramsey properties of random graphs and folkman numbers
• Towards the 0-statement of the Kohayakawa-Kreuter conjecture
• Sharp thresholds for certain Ramsey properties of random graphs
• Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
• An asymmetric random Rado theorem: 1-statement

This page was built for publication: Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601439)