ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with nn vertices and minimum degree at least 22. The game domination number γg(G)\gamma_g(G) is the number of moves in the domination game when Dominator starts and both players play optimally. The 1/2-conjecture.

γg(G)≤⌈12n⌉.\gamma_g(G) \leq \left\lceil \frac{1}{2}n \right\rceil.

This is the stronger target for graphs without leaves, improving the known general 3n/53n/5 bound. The paper proves 10n/17+1/1710n/17+1/17, 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 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.