Offline thresholds for Ramsey-type games on random graphs
From MaRDI portal
Publication:3055878
DOI10.1002/RSA.20294zbMATH Open1203.91038OpenAlexW3083595960MaRDI QIDQ3055878FDOQ3055878
Authors: Michael Krivelevich, Reto Spöhel, Angelika Steger 
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Ramsey theory (05D10)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Weighted sums of certain dependent random variables
- Avoiding small subgraphs in Achlioptas processes
- Ramsey Games Against a One-Armed Bandit
- Birth control for giants
- Upper bounds for online Ramsey games in random graphs
- Online Ramsey games in random graphs
- Balanced online Ramsey games in random graphs
- Online balanced graph avoidance games
- Title not available (Why is that?)
Cited In (9)
- Picker-chooser fixed graph games
- On balanced coloring games in random graphs
- Ramsey, paper, scissors
- Small subgraphs in random graphs and the power of multiple choices
- Ramsey properties of random discrete structures
- Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
- Asymmetric cycle avoidance online Ramsey games in random graphs.
- Waiter-client and client-waiter Hamiltonicity games on random graphs
- On balanced coloring games in random graphs
This page was built for publication: Offline thresholds for Ramsey-type games on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055878)
