Kinnersley–West–Zamani 3/5-conjecture for the domination game
Statement
Let be an isolate-free graph of order , and let denote the game domination number, the number of vertices selected when Dominator starts and both players play optimally. Kinnersley–West–Zamani's 3/5-conjecture. One should have
The source mentions this as a central conjecture for the ordinary domination game, posed by Kinnersley, West and Zamani; the supplied text gives no resolution status.
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.