[2305.02725] Two-round Ramsey games on random graphs
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status Get status notifications via email or slack
[2305.02725] Two-round Ramsey games on random graphs --> Mathematics > Combinatorics arXiv:2305.02725 (math) [Submitted on 4 May 2023] Title: Two-round Ramsey games on random graphs Authors: Yahav Alon , Patrick Morris , Wojciech Samotij View a PDF of the paper titled Two-round Ramsey games on random graphs, by Yahav Alon and 2 other authors View PDF Abstract: Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single-player game whose goal is to colour the edges of a~rand
Explore this link on the map →saved by
related reading
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- random subgraphs rainbowarxiv.org
- Rainbow Turán Problemspeople.math.ethz.ch
- Exact Stability for Turan's Theoremarxiv.org
- Patrick Morrissites.google.com
- piercing intervals - gyarfasarxiv.org
- 2-reachable subsets in two-colored graphsarxiv.org
- rainbow treesarxiv.org
- Sublinear expandersias.edu
- Cover times - spectralarxiv.org
- refining bounds - cover timesarxiv.org