Online balanced graph avoidance games

DOI10.1016/j.ejc.2007.04.004zbMath1126.05050OpenAlexW2127936896MaRDI QIDQ2461779

Miloš Stojaković, Martin Marciniszyn, Dieter Mitsche

Publication date: 21 November 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.04.004

zbMATH Keywords

optimal strategyrandom graph processmonochromatic copyonline balanced coloring games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Bounded degree, triangle avoidance graph games ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Offline thresholds for Ramsey-type games on random graphs ⋮ Hamiltonicity thresholds in Achlioptas processes ⋮ On balanced coloring games in random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey games
• Positional games and the second moment method
• On the Choice Number of Random Hypergraphs
• Threshold functions for small subgraphs
• Ramsey Games Against a One-Armed Bandit
• Positional games on random graphs
• Threshold Functions for Ramsey Properties
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Online balanced graph avoidance games