The domatic game first-player difference conjecture
Statement
Let be a graph. Write and for the domatic game numbers when Alice and Bob, respectively, move first.
First-player difference conjecture. For all graphs ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.