ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Write domg⁡(G,A)\operatorname{dom_g}(G,A) and domg⁡(G,B)\operatorname{dom_g}(G,B) for the domatic game numbers when Alice and Bob, respectively, move first.

First-player difference conjecture. For all graphs GG,

∣domg⁡(G,A)−domg⁡(G,B)∣≤1.\left|\operatorname{dom_g}(G,A)-\operatorname{dom_g}(G,B)\right|\leq 1.

The conjecture proposes that changing which player moves first changes the domatic game number by at most one. The surrounding discussion notes that all known examples satisfy this bound, but does not establish it in general; the status is therefore open.

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.