The maximum-degree bound for the configuration-wise minimum-light-number gap
Statement
Let be a graph, let be its vertex set, let denote the degree of a vertex , and let be a configuration. Let and denote the minimum light numbers of for the sigma-game and lit-only sigma-game on , respectively.
Maximum-degree gap conjecture. For every graph and every configuration ,
The conjecture is suggested by bounds proved in the paper for graphs obtained from trees by adding loops, unicyclic graphs, and grid graphs. Its resolution is not given 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.