A Short Proof of the Random Ramsey Theorem

DOI10.1017/S0963548314000832zbMath1371.05272MaRDI QIDQ5364263

Angelika Steger, Rajko Nenadov

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Related Items (25)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Towards the 0-statement of the Kohayakawa-Kreuter conjecture ⋮ Ramsey properties of random graphs and folkman numbers ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ Chromatic number is Ramsey distinguishing ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ A Note on Induced Ramsey Numbers ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ Blowup Ramsey numbers ⋮ On the number of points in general position in the plane ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ An exponential-type upper bound for Folkman numbers ⋮ An efficient container lemma ⋮ Ramsey games near the critical threshold ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ On the threshold for the Maker-BreakerH-game ⋮ Random Van der Waerden theorem ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Minimal ordered Ramsey graphs ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• Ramsey properties of random graphs
• A short proof of Nash-Williams' theorem for the arboricity of a graph
• Asymmetric Ramsey properties of random graphs involving cliques
• Ramsey properties of random discrete structures
• A randomized version of Ramsey's theorem
• Random graphs with monochromatic triangles in every edge coloring
• Threshold Functions for Ramsey Properties
• Independent sets in hypergraphs

This page was built for publication: A Short Proof of the Random Ramsey Theorem