A Winning Strategy for the Ramsey Graph Game
From MaRDI portal
Publication:4715271
DOI10.1017/S0963548300002030zbMath0865.90148MaRDI QIDQ4715271
Publication date: 12 November 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (13)
Fast winning strategies in avoider-enforcer games ⋮ Hitting time results for Maker-Breaker games ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Fast winning strategies in positional games ⋮ 2-connected graphs with small 2-connected dominating sets. ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ On the clique-game ⋮ Upper bounds on positional Paris-Harrington games ⋮ Domination number of graphs without small cycles ⋮ Strong Ramsey games in unbounded time ⋮ Winning Fast in Sparse Graph Construction Games ⋮ Domination in bipartite graphs ⋮ Fast winning strategies in maker-breaker games
Cites Work
This page was built for publication: A Winning Strategy for the Ramsey Graph Game
