F-Saturation Games
| dc.creator | Lee, Jonathan D. | |
| dc.creator | Riet, Ago-Erik | |
| dc.date.accessioned | 2018-11-24T23:26:25Z | |
| dc.date.available | 2015-06-22T11:20:07Z | |
| dc.date.available | 2018-11-24T23:26:25Z | |
| dc.date.issued | 2015-06-23 | |
| dc.identifier | https://www.repository.cam.ac.uk/handle/1810/248608 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3825 | |
| dc.description.abstract | We study F-saturation games, first introduced by Füredi, Reimer and Seress [4] in 1991, and named as such by West [5]. 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. | |
| dc.language | en | |
| dc.publisher | Elsevier | |
| dc.publisher | Discrete Mathematics | |
| dc.title | F-Saturation Games | |
| dc.type | Article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| Lee & Riet 2015 Discrete Mathematics.pdf | 296.2Kb | application/pdf | View/ |