Positional games on random graphs
From MaRDI portal
Publication:4667863
DOI10.1002/rsa.20059zbMath1117.91014arXivmath/0601659OpenAlexW2528878859MaRDI QIDQ4667863
Publication date: 21 April 2005
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0601659
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (27)
Creating cycles in walker-breaker games ⋮ Fast Strategies In Maker–Breaker Games Played on Random Boards ⋮ Hitting time results for Maker-Breaker games ⋮ Hitting Time Theorems for Random Matrices ⋮ A threshold for the Maker-Breaker clique game ⋮ On the WalkerMaker-WalkerBreaker games ⋮ A remark on the tournament game ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Galton–Watson games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Multistage positional games ⋮ Fast strategies in Waiter-Client games ⋮ The Random Graph Intuition for the Tournament Game ⋮ On the clique-game ⋮ Online balanced graph avoidance games ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Component Games on Regular Graphs ⋮ Connector-breaker games on random boards ⋮ Random directed graphs are robustly Hamiltonian ⋮ On the threshold for the Maker-BreakerH-game ⋮ Maker–Breaker percolation games I: crossing grids ⋮ Unnamed Item ⋮ Maker‐breaker games on random geometric graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Biased games on random boards ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Positional games and the second moment method
- Hitting time for \(k\) edge-disjoint spanning trees in a random graph
- A note on Hamiltonian circuits
- Biased positional games and the phase transition
- Remarks on positional games. I
- A Solution of the Shannon Switching Game
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Positional games on random graphs