Fast winning strategies in positional games

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker's win, then set τM (H) = ∞). Similarly, for the unbiased Avoider-Enforcer game played on H, let τE (H) be the smallest integer t such that Enforcer can win the game within t moves (if the game is an Avoider's win, then set τM (E) = ∞). We investigate τM and τE and determine their value for various positional games.

Original languageEnglish
Pages (from-to)213-217
Number of pages5
JournalElectronic Notes in Discrete Mathematics
Issue numberSPEC. ISS.
StatePublished - 15 Aug 2007


FundersFunder number
USA-Israel BSF2002-133, 526/05
Ministry of Science and Environmental Protection
Israel Science Foundation


    • Avoider-Enforcer
    • Maker-Breaker
    • connectivity
    • planarity


    Dive into the research topics of 'Fast winning strategies in positional games'. Together they form a unique fingerprint.

    Cite this