Winning Fast in Sparse Graph Construction Games
- 1 November 2008
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 17 (6) , 781-791
Abstract
A graph construction game is a Maker–Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graphKN. Maker's aim is to claim a copy of a given target graphGwhile Breaker's aim is to prevent Maker from doing so. In this paper we show that ifGis ad-degenerate graph onnvertices andN>d1122d+9n, then Maker can claim a copy ofGin at mostd1122d+7nrounds. We also discuss a lower bound on the number of rounds Maker needs to win, and the gap between these bounds.Keywords
This publication has 1 reference indexed in Scilit:
- Discrepancy GamesThe Electronic Journal of Combinatorics, 2005