Deterministic Graph Games and a Probabilistic Intuition

DOI10.1017/S0963548300000936zbMath0819.90147OpenAlexW2062589906MaRDI QIDQ4306428

József Beck

Publication date: 24 October 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000936

zbMATH Keywords

random graph processesbiased graph games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Probabilistic games; gambling (91A60)

Related Items (16)

A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ The Random Graph Intuition for the Tournament Game ⋮ On the clique-game ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Fast embedding of spanning trees in biased Maker-Breaker games ⋮ Game chromatic index of graphs with given restrictions on degrees ⋮ Robust Hamiltonicity of Dirac graphs ⋮ The picker-chooser diameter game ⋮ The diameter game ⋮ Asymptotic random graph intuition for the biased connectivity game ⋮ Winning Fast in Sparse Graph Construction Games ⋮ Maker–Breaker percolation games I: crossing grids ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ On chooser-picker positional games

Cites Work

• Long paths in sparse random graphs
• The Ramsey number of a graph with bounded maximum degree
• Van der Waerden and Ramsey type games
• Expanding graphs contain all small trees
• Hamiltonian circuits in random graphs
• Remarks on positional games. I
• Biased Positional Games
• On a combinatorial game

This page was built for publication: Deterministic Graph Games and a Probabilistic Intuition