Positional Games and the Second Moment Method

Dedicated to the memory of Paul ErdősWe study the fair Maker–Breaker graph Ramsey game MB(n;q). The board is , the players alternately occupy one edge a move, and Maker wants a clique of his own. We show that Maker has a winning strategy in MB(n;q) if , which is exactly the clique number of the random graph on n vertices with edge-probability 1/2. Due to an old theorem of Erdős and Selfridge this is best possible apart from an additive constant.

[1]  József Beck.  On Positional Games , 1981, J. Comb. Theory, Ser. A.

[2]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory, Ser. A.

[3]  P. Erdös,et al.  Biased Positional Games , 1978 .

[4]  Aleksandar Pekec,et al.  A Winning Strategy for the Ramsey Graph Game , 1995, Combinatorics, Probability and Computing.

[5]  József Beck,et al.  Random Graphs and Positional Games on the Complete Graph , 1985 .

[6]  Tomasz Luczak,et al.  Biased positional games and the phase transition , 2001, Random Struct. Algorithms.

[7]  Tomasz Luczak,et al.  Biased Positional Games for Which Random Strategies are Nearly Optimal , 2000, Comb..