A Winning Strategy for the Ramsey Graph Game

  title={A Winning Strategy for the Ramsey Graph Game},
  author={Aleksandar Pekec},
  journal={Combinatorics, Probability & Computing},
We consider a \Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + 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. 

2 Figures & Tables