Winning Fast in Sparse Graph Construction Games

A graph construction game is a Maker–Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN. Maker's aim is to claim a copy of a given target graph G while Breaker's aim is to prevent Maker from doing so. In this paper we show that if G is a d-degenerate graph on n vertices and N >d1122d+9n, then Maker can claim a copy of G in at most d1122d+7n rounds. We also discuss a lower bound on the number of rounds Maker needs to win, and the gap between these bounds.

[1]  József Beck,et al.  Deterministic Graph Games and a Probabilistic Intuition , 1994, Combinatorics, Probability and Computing.

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

[3]  S. Burr.  ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS , 1973 .

[4]  József Beck.  Ramsey games , 2002, Discret. Math..

[5]  J. Beck.  Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[8]  Noga Alon,et al.  Discrepancy Games , 2005, Electron. J. Comb..