How fast can maker win in fair biased games?

DOI10.1016/j.disc.2017.06.023zbMath1372.05139arXiv1602.02495OpenAlexW2964042906MaRDI QIDQ2411594

Mirjana Mikalački, Dennis Clemens

Publication date: 24 October 2017

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

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

zbMATH Keywords

games on graphsstrong gamesfast winningMaker-Breaker games

Mathematics Subject Classification ID

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

Related Items (5)

Fast winning strategies for the maker-breaker domination game ⋮ Winning fast in biased maker-breaker games ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ Fast strategies in Waiter-Client games ⋮ Maker-breaker domination number

Cites Work

• Doubly biased maker-breaker connectivity game
• Winning strong games through fast strategies for weak games
• On two problems regarding the Hamiltonian cycle game
• Hamiltonian circuits in random graphs
• Positional games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• The diameter game
• Asymptotic random graph intuition for the biased connectivity game
• Fast Strategies In Maker–Breaker Games Played on Random Boards
• Combinatorial Games
• A Solution of the Shannon Switching Game

This page was built for publication: How fast can maker win in fair biased games?