Fast winning strategies in avoider-enforcer games

DOI10.1007/s00373-009-0870-8zbMath1181.91044arXiv0806.0280OpenAlexW2013432272MaRDI QIDQ844236

Miloš Stojaković, Michael Krivelevich, Tibor Szabó, Dan Hefetz

Publication date: 18 January 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.0280

zbMATH Keywords

bipartiteconnectivityplanarity

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Related Items (3)

Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Game matching number of graphs ⋮ Sharp thresholds for half-random games. II

Cites Work

• How long can a graph be kept planar?
• On positional games
• Avoider-Enforcer games
• Fast winning strategies in maker-breaker games
• Planarity, Colorability, and Minor Games
• On Biased Positional Games
• A universal planar graph under the minor relation
• A Winning Strategy for the Ramsey Graph Game
• Combinatorial Games

This page was built for publication: Fast winning strategies in avoider-enforcer games