Upper Bounds for Online Ramsey Games in Random Graphs

DOI10.1017/S0963548308009620zbMath1191.05081MaRDI QIDQ3557512

Reto Spöhel, Angelika Steger, Martin Marciniszyn

Publication date: 23 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Combinatorial games (91A46) Probabilistic games; gambling (91A60)

Related Items (9)

Bounded degree, triangle avoidance graph games ⋮ On-line Ramsey numbers of paths and cycles ⋮ Short Proofs of Some Extremal Results ⋮ Online vertex-coloring games in random graphs ⋮ Online Ramsey games for more than two colors ⋮ Offline thresholds for Ramsey-type games on random graphs ⋮ Ramsey properties of random discrete structures ⋮ Ramsey games with giants ⋮ Coloring random graphs online without creating monochromatic subgraphs

Cites Work

• Ramsey properties of random graphs
• Ramsey Games Against a One-Armed Bandit
• Threshold Functions for Ramsey Properties

This page was built for publication: Upper Bounds for Online Ramsey Games in Random Graphs