Key points are not available for this paper at this time.
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.
Araújo et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: