Online vertex-coloring games in random graphs

DOI10.1007/S00493-010-2436-ZzbMath1224.05475OpenAlexW1985022633MaRDI QIDQ532126

Martin Marciniszyn, Reto Spöhel

Publication date: 26 April 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/18519

zbMATH Keywords

random graphthresholdavoid a fixed subgraphonline coloring game

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Density (toughness, etc.) (05C42)

Related Items (1)

Coloring random graphs online without creating monochromatic subgraphs

Cites Work

• Unnamed Item
• Upper Bounds for Online Ramsey Games in Random Graphs
• Online Ramsey Games in Random Graphs
• Threshold functions for small subgraphs
• Poisson approximation for large deviations
• Ramsey Games Against a One-Armed Bandit
• Hunting for sharp thresholds

This page was built for publication: Online vertex-coloring games in random graphs