Connector-breaker games on random boards
From MaRDI portal
Publication:2040008
DOI10.37236/9381zbMath1467.05171arXiv1911.01724OpenAlexW3180397121MaRDI QIDQ2040008
Yannick Mogge, Laurin Kirsch, Dennis Clemens
Publication date: 6 July 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01724
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Creating cycles in walker-breaker games
- Doubly biased maker-breaker connectivity game
- Threshold functions
- On the WalkerMaker-WalkerBreaker games
- On the odd cycle game and connected rules
- Positional games
- On the threshold for the Maker-BreakerH-game
- Walker-Breaker Games
- The diameter game
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Generating random graphs in biased Maker-Breaker games
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- Biased Positional Games
- Spanning Tree Game as Prim Would Have Played
- Positional games on random graphs
- Biased games on random boards
- A Solution of the Shannon Switching Game
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Connector-breaker games on random boards