The minimum-light-number gap conjecture for trees with loops
Statement
Let be obtained from a tree by adding some loops. The quantities and denote the minimum light numbers of the sigma-game and lit-only sigma-game on , respectively.
Tree gap conjecture.
This conjecture concerns how much the lit-only restriction can increase the minimum light number. The paper gives a general upper bound of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.