Biased positional games and the phase transition
From MaRDI portal
Publication:2712577
DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200103)18:2<141::AID-RSA1002>3.0.CO;2-W" /><141::AID-RSA1002>3.0.CO;2-W 10.1002/1098-2418(200103)18:2<141::AID-RSA1002>3.0.CO;2-WzbMath0977.91010OpenAlexW2027269176MaRDI QIDQ2712577
Małgorzata Bednarska, Tomasz Łuczak
Publication date: 27 January 2002
Full work available at URL: https://doi.org/10.1002/1098-2418(200103)18:2<141::aid-rsa1002>3.0.co;2-w
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Combinatorial games (91A46)
Related Items (13)
The maker-breaker largest connected subgraph game ⋮ The Random Graph Intuition for the Tournament Game ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ On the clique-game ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Client-waiter games on complete and random graphs ⋮ Component Games on Regular Graphs ⋮ Positional games on random graphs ⋮ The picker-chooser diameter game ⋮ The diameter game ⋮ Asymptotic random graph intuition for the biased connectivity game ⋮ Maker–Breaker percolation games I: crossing grids ⋮ The phase transition in random graphs: A simple proof
This page was built for publication: Biased positional games and the phase transition
