Fast winning strategies in positional games

DOI10.1016/j.endm.2007.07.046zbMath1341.05159OpenAlexW2044885230MaRDI QIDQ3503475

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

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.046

zbMATH Keywords

connectivityplanarityavoider-enforcer gamemaker-breaker game

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• On positional games
• Avoider-Enforcer games
• Planarity, Colorability, and Minor Games
• Biased Positional Games
• A Winning Strategy for the Ramsey Graph Game
• Combinatorial Games
• A Solution of the Shannon Switching Game

This page was built for publication: Fast winning strategies in positional games