ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let V(G)V(G) be its vertex set, let deg⁡G(v)\deg_G(v) denote the degree of a vertex vv, and let x∈F2V(G)x\in\mathbb{F}_2^{V(G)} be a configuration. Let MLG(x)ML_G(x) and MLG∗(x)ML^*_G(x) denote the minimum light numbers of xx for the sigma-game and lit-only sigma-game on GG, respectively.

Maximum-degree gap conjecture. For every graph GG and every configuration xx,

MLG∗(x)−MLG(x)≤max⁡v∈V(G)deg⁡G(v).ML^*_G(x)-ML_G(x)\leq\max_{v\in V(G)}\deg_G(v).

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 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.