Deterministic Graph Games and a Probabilistic Intuition

DOI10.1017/S0963548300000936MaRDI QIDQ4306428zbMATH OpenOpenAlexFDO

Authors 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

biased graph gamesrandom graph processes

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(24)

• On chooser-picker positional games
• Maker-breaker percolation games. II: Escaping to infinity
• A probabilistic representation of exact games on image-algebras
• Size Ramsey number of bounded degree graphs for games
• Fast embedding of spanning trees in biased maker-breaker games
• Building spanning trees quickly in maker-breaker games
• The diameter game
• Asymptotic random graph intuition for the biased connectivity game
• Determinacy of adversarial Gowers games
• A non-trivial upper bound on the threshold bias of the oriented-cycle game
• Winning Fast in Sparse Graph Construction Games
• Fast embedding of spanning trees in biased maker-breaker games
• scientific article; zbMATH DE number 1047712 (Why is no real title available?)
• scientific article; zbMATH DE number 6829368 (Why is no real title available?)
• scientific article; zbMATH DE number 6862070 (Why is no real title available?)
• Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
• Maker–Breaker percolation games I: crossing grids
• Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees
• The random graph intuition for the tournament game
• Robust Hamiltonicity of Dirac graphs
• On the clique-game
• The picker-chooser diameter game
• An improved upper bound on the threshold bias of the Oriented-cycle game
• Game chromatic index of graphs with given restrictions on degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4306428)