Bounds for the Competition-Independence game on trees
arXiv:2303.09993
Abstract
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least moves for every tree. Moreover, we show that there exist arbitrarily large trees such that the Sweller-Start Competition-Independence game lasts at most moves, disproving a conjecture by Henning.