A Winning Strategy for the Ramsey Graph Game

DOI10.1017/S0963548300002030MaRDI QIDQ4715271zbMATH OpenFDO

Authors Aleksandar Pekeč

Publication date 12 November 1996

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

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

zbMATH Keywords

Ramsey graph gamewinning strategy

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Positional games and the second moment method
• scientific article; zbMATH DE number 3946179
• scientific article; zbMATH DE number 969183
• Fast winning strategies in maker-breaker games
• Strong Ramsey games in unbounded time

Cites work

• On a combinatorial game
• Van der Waerden and Ramsey type games

Cited in

(19)

• 2-connected graphs with small 2-connected dominating sets.
• Positional games and the second moment method
• Pairs of disjoint dominating sets and the minimum degree of graphs
• Strong Ramsey games in unbounded time
• The Namer-Claimer game
• Upper bounds on positional Paris-Harrington games
• Strong Ramsey games: drawing on an infinite board
• Fast winning strategies in maker-breaker games
• Hitting time results for maker-breaker games
• Building spanning trees quickly in maker-breaker games
• Ramsey, paper, scissors
• Fast winning strategies in positional games
• Winning Fast in Sparse Graph Construction Games
• scientific article; zbMATH DE number 3946179 (Why is no real title available?)
• On the clique-game
• Domination number of graphs without small cycles
• The rational number game
• Fast winning strategies in avoider-enforcer games
• Domination in bipartite graphs

This page was built for publication: A Winning Strategy for the Ramsey Graph Game

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