The 1/2-conjecture for the domination game
Statement
Let be a graph with vertices and 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. The 1/2-conjecture.
This is the stronger target for graphs without leaves, improving the known general bound. The paper proves , which is progress toward the conjecture, but the 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.