Ramsey numbers of cycles in random graphs
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.
Authors
- Matías Pavez‐Signé (ORCID: https://orcid.org/0000-0001-9418-5058)
- Nicolás Sanhueza‐Matamala (ORCID: https://orcid.org/0000-0003-4791-5710)
- Pedro Araújo (ORCID: https://orcid.org/0000-0002-2381-1709)
Institutions
- University of Concepción (CL)
- Czech Technical University in Prague (CZ)
- University of Chile (CL)
Publication Details
- Journal
- Random Structures and Algorithms
- Published
- 2024-08-09
- DOI
- https://doi.org/10.1002/rsa.21253
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Grantová Agentura České Republiky
- H2020 European Research Council