ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, and let γg(T)\gamma_g(T) and γg′(T)\gamma_g'(T) denote the Dominator-start and Staller-start game domination numbers, respectively. A pair (r,s)(r,s) is realizable by a tree if there is a tree TT with (γg(T),γg′(T))=(r,s)(\gamma_g(T),\gamma_g'(T))=(r,s).

Tree domination-game pair conjecture. No pair of the form (k,k−1)(k,k-1) can be realized by a tree.

The paper proves that (3,2)(3,2) and (4,3)(4,3) are not realizable and establishes realizability for the other discussed families, while the general nonrealizability of (k,k−1)(k,k-1) remains conjectural.

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.