Upper Bounds for Online Ramsey Games in Random Graphs
From MaRDI portal
Publication:3557512
DOI10.1017/S0963548308009620zbMATH Open1191.05081MaRDI QIDQ3557512FDOQ3557512
Reto Spöhel, Angelika Steger, Martin Marciniszyn
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Games involving graphs (91A43) Combinatorial games (91A46) Probabilistic games; gambling (91A60)
Cites Work
Cited In (12)
- Ramsey properties of random discrete structures
- Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
- Ramsey games with giants
- Short Proofs of Some Extremal Results
- Bounded degree, triangle avoidance graph games
- Coloring random graphs online without creating monochromatic subgraphs
- Asymmetric cycle avoidance online Ramsey games in random graphs.
- Online vertex-coloring games in random graphs
- Online Ramsey games for more than two colors
- On-line Ramsey numbers of paths and cycles
- Bounds on Ramsey games via alterations
- Offline thresholds for Ramsey-type games on random graphs
This page was built for publication: Upper Bounds for Online Ramsey Games in Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557512)