ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be obtained from a tree by adding some loops. The quantities ML(G)ML(G) and ML∗(G)ML^*(G) denote the minimum light numbers of the sigma-game and lit-only sigma-game on GG, respectively.

Tree gap conjecture.

ML∗(G)−ML(G)∈{0,1}.ML^*(G)-ML(G)\in \{0,1\}.

This conjecture concerns how much the lit-only restriction can increase the minimum light number. The paper gives a general upper bound of 22 for the corresponding configuration-wise difference on these graphs, with sharpness, but the stated conjecture remains open in the supplied text.

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.