Creating cycles in walker-breaker games

DOI10.1016/J.DISC.2016.03.007zbMath1336.05092arXiv1505.02678OpenAlexW2250043689MaRDI QIDQ284747

F. Blanchet-Sadri, M. Dambrine

Publication date: 18 May 2016

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

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

zbMATH Keywords

positional gamescycle gamethreshold biaswalker-breaker

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Spanning Structures in Walker–Breaker Games ⋮ On the WalkerMaker-WalkerBreaker games ⋮ Maker-Breaker total domination game on cubic graphs ⋮ On the odd cycle game and connected rules ⋮ Connector-breaker games on random boards

Cites Work

• Unnamed Item
• On two problems regarding the Hamiltonian cycle game
• Biased positional games on matroids
• Positional games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• On the threshold for the Maker-BreakerH-game
• Hitting time results for Maker-Breaker games
• Walker-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
• Dirac's theorem for random graphs
• Generating random graphs in biased Maker-Breaker games
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Biased Positional Games
• Positional games on random graphs
• Biased games on random boards
• Combinatorial Games
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Creating cycles in walker-breaker games