Online Ramsey Games in Random Graphs

DOI10.1017/S0963548308009632zbMath1202.91041MaRDI QIDQ3557513

Martin Marciniszyn, Reto Spöhel, Angelika Steger

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) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (13)

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

Cites Work

• Ramsey properties of random graphs
• Threshold functions
• The Ramsey property for graphs with forbidden complete subgraphs
• Threshold functions for small subgraphs
• Ramsey Games Against a One-Armed Bandit
• Hunting for sharp thresholds
• Threshold Functions for Ramsey Properties
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

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