ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a nonempty graph. For a vertex vv and an edge ee, write G−vG-v and G−eG-e for the graphs obtained by deleting vv and ee, respectively. The monotonicity sandwich conjecture. There exist a vertex vv and an edge ee such that

avd⁡(G−v)<avd⁡(G)<avd⁡(G−e).\operatorname{avd}(G-v)<\operatorname{avd}(G)<\operatorname{avd}(G-e).

Although deleting a vertex or edge always decreases the number of dominating sets, it need not make the average order of a dominating set monotone in either direction. The conjecture is reported to hold for all graphs on at most 77 vertices; its validity for all nonempty graphs 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.