Show simple item record

F-Saturation Games

dc.creatorLee, Jonathan D.
dc.creatorRiet, Ago-Erik
dc.date.accessioned2018-11-24T23:26:25Z
dc.date.available2015-06-22T11:20:07Z
dc.date.available2018-11-24T23:26:25Z
dc.date.issued2015-06-23
dc.identifierhttps://www.repository.cam.ac.uk/handle/1810/248608
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/123456789/3825
dc.description.abstractWe 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.languageen
dc.publisherElsevier
dc.publisherDiscrete Mathematics
dc.titleF-Saturation Games
dc.typeArticle


Files in this item

FilesSizeFormatView
Lee & Riet 2015 Discrete Mathematics.pdf296.2Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record