ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices with 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. Bujtás–Iršič–Klavžar's additive conjecture. There exists a universal constant CC such that

γg(G)≤12n+C.\gamma_g(G) \leq \frac{1}{2}n+C.

This is a relaxation of the conjectured bound γg(G)≤⌈n/2⌉\gamma_g(G) \leq \lceil n/2\rceil for graphs of minimum degree at least 22. The paper's 10n/17+1/1710n/17+1/17 result does not reach the coefficient 1/21/2, 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 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.