ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph containing a swap set. Let DDm⁡(G)DD_{\operatorname{m}}(G) denote the minimum size of a disjoint dominating set whose two parts are joined by a perfect matching, and let α(G)\alpha(G) be the independence number of GG. Disjoint-domination independence conjecture.

DDm⁡(G)≤α(G).DD_{\operatorname{m}}(G)\leq\alpha(G).

The conjecture asserts the existence of a desired matching between two disjoint dominating sets whose total size is controlled by the independence number. The supplied text does not state whether this 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.