ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of order nn. The competition-independence number Is(T)I_s(T), namely the length of the competition-independence game when Sweller moves first and both players play optimally, satisfies

Is(T)≥37n.I_s(T) \geq \frac{3}{7}n.

Henning's conjecture. For every tree TT of order nn, Is(T)≥37nI_s(T) \geq \frac{3}{7}n. The paper disproves this conjecture by exhibiting arbitrarily large trees for which the Sweller-start game lasts at most (5n+26)/12(5n+26)/12 moves, while proving the general lower bound Is(T)≥(5n+3)/13I_s(T)\geq(5n+3)/13.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.