ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph with ∣V(G)∣=n|V(G)|=n. The parameters γgrZ,k(G)\gamma_{gr}^{Z,k}(G) and Fk(G)F_k(G) denote the kk-Grundy Z-domination number and the kk-forcing number, respectively.

Equality conjecture.

γgrZ,k(G)=n−Fk(G).\gamma_{gr}^{Z,k}(G)=n-F_k(G).

This conjecture would show that the lower bound established in the preceding theorem is always sharp. The supplied text gives no evidence that the conjecture has been resolved.

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.