Winning fast in biased maker-breaker games

DOI10.1016/j.endm.2017.07.047zbMath1378.05132OpenAlexW2744940187MaRDI QIDQ1690027

Miloš Stojaković, Mirjana Mikalački

Publication date: 18 January 2018

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

zbMATH Keywords

perfect matchingHamilton cyclebiased gamesfast winning strategiesmaker-breaker graph games

Mathematics Subject Classification ID

Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Positional games (pursuit and evasion, etc.) (91A24) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Winning strong games through fast strategies for weak games
• On two problems regarding the Hamiltonian cycle game
• How fast can maker win in fair biased games?
• Positional games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Fast Strategies In Maker–Breaker Games Played on Random Boards
• Biased Positional Games
• Combinatorial Games

This page was built for publication: Winning fast in biased maker-breaker games