Component Games on Regular Graphs
From MaRDI portal
Publication:5414147
DOI10.1017/S0963548313000527zbMath1287.05090arXiv1301.0282OpenAlexW2962727181MaRDI QIDQ5414147
Publication date: 2 May 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0282
Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Global maker-breaker games on sparse graphs
- Ramanujan graphs
- Chromatic number, girth and maximal degree
- Percolation on finite graphs and isoperimetric inequalities.
- Biased positional games and the phase transition
- Asymptotic random graph intuition for the biased connectivity game
- Critical percolation on random regular graphs
- Expander graphs and their applications
- Biased Positional Games
- On the Edge-Expansion of Graphs
- Positional games on random graphs
- A Solution of the Shannon Switching Game
- Zur algebraischen Begründung der Graphentheorie. I
This page was built for publication: Component Games on Regular Graphs