The tree domination-game pair conjecture
Statement
Let be a tree, and let and denote the Dominator-start and Staller-start game domination numbers, respectively. A pair is realizable by a tree if there is a tree with .
Tree domination-game pair conjecture. No pair of the form can be realized by a tree.
The paper proves that and are not realizable and establishes realizability for the other discussed families, while the general nonrealizability of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.