Abstract
Let be the Ramsey number of the cycle on vertices. We prove that, for some , with high probability every 2‐coloring of the edges of has a monochromatic copy of , as long as and . This is sharp up to the value of and it improves results of Letzter and of Krivelevich, Kronenberg, and Mond.
- Book : 66(1)
- Pub. Date : 2025
- Page : pp.e21253
- Keyword :
