Bounds for the Competition-Independence game on trees
Abstract
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least (5n+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 (5n+26)/12 moves, disproving a conjecture by Henning.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.