Offline thresholds for Ramsey-type games on random graphs
From MaRDI portal
Publication:3055878
DOI10.1002/rsa.20294zbMath1203.91038OpenAlexW3083595960MaRDI QIDQ3055878
Michael Krivelevich, Angelika Steger, Reto Spöhel
Publication date: 10 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20294
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Ramsey theory (05D10)
Related Items (6)
Picker-chooser fixed graph games ⋮ On Balanced Coloring Games in Random Graphs ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Ramsey properties of random discrete structures ⋮ On balanced coloring games in random graphs ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
Cites Work
- Unnamed Item
- Birth control for giants
- Balanced online Ramsey games in random graphs
- Online balanced graph avoidance games
- Weighted sums of certain dependent random variables
- Upper Bounds for Online Ramsey Games in Random Graphs
- Online Ramsey Games in Random Graphs
- Avoiding small subgraphs in Achlioptas processes
- Ramsey Games Against a One-Armed Bandit
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Offline thresholds for Ramsey-type games on random graphs
