Sharp thresholds for half-random games I
From MaRDI portal
Publication:2953698
DOI10.1002/RSA.20681zbMath1352.05128arXiv1507.06688OpenAlexW2588823771MaRDI QIDQ2953698
Publication date: 5 January 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06688
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
- Unnamed Item
- Picker-chooser fixed graph games
- Achlioptas process phase transitions are continuous
- Random-player maker-breaker games
- Biased positional games and small hypergraphs with large covers
- Positional games and the second moment method
- Sharp thresholds for half-random games. II
- Avoiding a giant component
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Dirac's theorem for random graphs
- Planarity, Colorability, and Minor Games
- Remarks on positional games. I
- Biased Positional Games
- Robust Hamiltonicity of Dirac graphs
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Sharp thresholds for half-random games I