Henning's Sweller-start competition-independence conjecture for trees
Statement
Let be a tree of order . The competition-independence number , namely the length of the competition-independence game when Sweller moves first and both players play optimally, satisfies
Henning's conjecture. For every tree of order , . The paper disproves this conjecture by exhibiting arbitrarily large trees for which the Sweller-start game lasts at most moves, while proving the general lower bound .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.