| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646956 | Discrete Mathematics | 2015 | 7 Pages |
Abstract
We study FF-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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jonathan D. Lee, Ago-Erik Riet,