Sharp thresholds for half-random games. II
From MaRDI portal
Publication:2014222
DOI10.1007/s00373-016-1753-4zbMath1368.05102arXiv1602.04628OpenAlexW2963483240MaRDI QIDQ2014222
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.04628
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Winning strong games through fast strategies for weak games
- Fast winning strategies in avoider-enforcer games
- Random-player maker-breaker games
- On winning fast in Avoider-Enforcer games
- On two problems regarding the Hamiltonian cycle game
- Weak and strong \(k\)-connectivity games
- Fast winning strategies in maker-breaker games
- Sharp thresholds for half-random games I
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Biased Positional Games
This page was built for publication: Sharp thresholds for half-random games. II