[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

saved by

• Luke Hawranick

related reading

• [2604.04115] Gallai 3-colourings of random graphsarxiv.org
• A Counterexample to a Conjecture of Lovászarxiv.org
• Random Turán Problems for Graphs with a Vertex Complete to One Partarxiv.org
• Arborescences of Random Covering Graphsarxiv.org
• Exact Stability for Turan's Theoremarxiv.org
• [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
• Forbidding Exactly One Hamming Distancearxiv.org
• Induced rational exponents near twoarxiv.org
• [2603.23431] On the number of families avoiding a subposetarxiv.org
• Rainbow Turán Problemspeople.math.ethz.ch
• rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
• [2004.10180] The regularity method for graphs with few 4-cyclesarxiv.org