ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an isolate-free graph of order nn, and let γg(G)\gamma_g(G) 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

γg(G)≤35n.\gamma_g(G) \leq \frac{3}{5}n.

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 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.