F-saturation games
Change log
Authors
Abstract
We study F-saturation games, first introduced by Füredi, Reimer and Seress in 1991, and named as such by West (2009). The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding game and the star avoiding game.
Description
This is the author accepted manuscript. The final version is available from Elsevier via http://dx.doi.org/10.1016/j.disc.2015.05.028
Journal Title
Discrete Mathematics
Conference Name
Journal ISSN
0012-365X
1872-681X
1872-681X
Volume Title
338
Publisher
Elsevier
Publisher DOI
Rights and licensing
Except where otherwised noted, this item's license is described as All Rights Reserved
Sponsorship
The first author was supported by Trinity College, Cambridge. The second author was partially supported by the Estonian Research Council through the research grants PUT405, PUT620 and IUT20-5.