A short proof of the random Ramsey theorem
From MaRDI portal
Publication:5364263
DOI10.1017/S0963548314000832zbMATH Open1371.05272MaRDI QIDQ5364263FDOQ5364263
Authors: Rajko Nenadov, Angelika Steger 
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Independent sets in hypergraphs
- A short proof of Nash-Williams' theorem for the arboricity of a graph
- Threshold Functions for Ramsey Properties
- Ramsey properties of random discrete structures
- Title not available (Why is that?)
- Random graphs with monochromatic triangles in every edge coloring
- Ramsey properties of random graphs
- Asymmetric Ramsey properties of random graphs involving cliques
- A randomized version of Ramsey's theorem
Cited In (26)
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- A Note on Induced Ramsey Numbers
- On the number of points in general position in the plane
- An efficient container lemma
- Ramsey games near the critical threshold
- Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Towards the 0-statement of the Kohayakawa-Kreuter conjecture
- Ramsey properties of random graphs and folkman numbers
- Schur properties of randomly perturbed sets
- Chromatic number is Ramsey distinguishing
- Orientation Ramsey Thresholds for Cycles and Cliques
- SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
- Ramsey Goodness of Clique Versus Paths in Random Graphs
- Blowup Ramsey numbers
- Small rainbow cliques in randomly perturbed dense graphs
- Minimal ordered Ramsey graphs
- On the threshold for the maker-breaker \(H\)-game
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Random Van der Waerden theorem
- An asymmetric random Rado theorem: 1-statement
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
- An exponential-type upper bound for Folkman numbers
This page was built for publication: A short proof of the random Ramsey theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364263)
