A Short Proof of the Random Ramsey Theorem

@article{Nenadov2016ASP,
  title={A Short Proof of the Random Ramsey Theorem},
  author={Rajko Nenadov and Angelika Steger},
  journal={Combinatorics, Probability & Computing},
  year={2016},
  volume={25},
  pages={130-144}
}
In this paper we give a short proof of the Random Ramsey Theorem of Rödl and Ruciński: for any graph F which contains a cycle and r ≥ 2, there exist constants c, C > 0 such that P[Gn,p → (F )r] = { 1− o(1), p ≥ Cn−1/m2(F ) o(1), p ≤ cn−1/m2(F , where m2(F ) = maxJ⊆F,vJ≥2 eJ−1 vJ−2 . The proof of the 1-statement is based on the recent beautiful hypergraph container theorems by Saxton/Thomason and Balogh/Morris/Samotij. The proof of the 0-statement is elementary. 

From This Paper

Figures, tables, and topics from this paper.
8 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Lower bounds on probability thresholds for Ramsey properties

  • V. Rödl, A. Ruciński
  • In Combinatorics, Paul Erdős is eighty,
  • 1993
Highly Influential
8 Excerpts

Hypergraph containers

  • A. Thomason

Similar Papers

Loading similar papers…