Ramsey games near the critical threshold

DOI10.1002/rsa.20959zbMath1460.05124arXiv1908.02991OpenAlexW3095762686MaRDI QIDQ3386523

Tamás Mészáros, Shagnik Das, David Conlon, Joonkyung Lee

Publication date: 5 January 2021

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.02991

zbMATH Keywords

random graphsRamsey theorypositional games

Mathematics Subject Classification ID

Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• On the KŁR conjecture in random graphs
• Hypergraph containers
• Szemerédi’s Regularity Lemma for Sparse Graphs
• SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
• Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
• Ramsey Games Against a One-Armed Bandit
• Threshold Functions for Ramsey Properties
• Ramsey properties of randomly perturbed graphs: cliques and cycles
• Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
• Independent sets in hypergraphs
• A Short Proof of the Random Ramsey Theorem

This page was built for publication: Ramsey games near the critical threshold