The additive 1/2-conjecture for the domination game
Statement
Let be a graph on vertices with minimum degree at least . The game domination number is the number of moves in the domination game when Dominator starts and both players play optimally. Bujtás–Iršič–Klavžar's additive conjecture. There exists a universal constant such that
This is a relaxation of the conjectured bound for graphs of minimum degree at least . The paper's result does not reach the coefficient , so this conjecture remains 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.