A Winning Strategy for the Ramsey Graph Game
Aleksandar Saša Pekeč · Combinatorics Probability Computing · 1996
We consider a «Maker-Breaker’ version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most ( n − 3)2 n −1 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games.