ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite simple bipartite graph without isolated vertices, with order n=∣V∣n=|V| and domination number γ(G)=γ\gamma(G)=\gamma. A unique minimum dominating set is a minimum dominating set of GG that is the only one. Define

Φ(n,γ)=max⁡(0,n−3γ−2⌈γ2⌉−⌊γ2⌋+1).\Phi(n,\gamma)=\max\left(0,n-3\gamma-2\left\lceil\frac{\gamma}{2}\right\rceil-\left\lfloor\frac{\gamma}{2}\right\rfloor+1\right).

Bipartite unique domination bound. If GG has a unique minimum dominating set, γ≥2\gamma\geq 2, and n≥3γn\geq 3\gamma, then its size s(G)s(G) is bounded above by

m(n,\gamma)=2\gamma+2\left\lceil\frac{\gamma}{2}\right\rceil\left\lfloor\frac{\gamma}{2}\right\rfloor+\min\left\\{n-3\gamma,2\left\lceil\frac{\gamma}{2}\right\rceil-\left\lfloor\frac{\gamma}{2}\right\rfloor+1\right\\}\left(2\left\lceil\frac{\gamma}{2}\right\rceil+1\right)+\sum_{i=1}^{\Phi}\left(2\left\lceil\frac{\gamma}{2}\right\rceil+1+\left\lceil\frac{i}{2}\right\rceil\right).

This conjecture proposes the sharp edge bound for bipartite graphs with a unique minimum dominating set in the stated range, refining the general bounds for uniquely dominatable graphs and complementing known results for special cases such as domination number 22.

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.