Bounds for the competition-independence game on trees
Published version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abstract
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least ( 5 n + 3 ) / 13 moves for every tree. Moreover, we show that there exist arbitrarily large trees such that the Sweller-Start Competition-Independence game lasts at most ( 5 n + 26 ) / 12 moves, disproving a conjecture by Henning.
Description
Journal Title
Discrete Mathematics
Conference Name
Journal ISSN
0012-365X
Volume Title
347
Publisher
Elsevier
Publisher DOI
Rights and licensing
Except where otherwised noted, this item's license is described as Attribution 4.0 International
Sponsorship
EPSRC (EP/V52024X/1)
EPSRC (EP/T517847/1)
EPSRC (EP/T517847/1)