ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. The broadcast domination number γb(G){\gamma_b}(G) is the minimum cost of a dominating broadcast on GG, and mp(G){\mathrm{mp}}(G) is the maximum size of a multipacking in GG. A multipacking is a subset of vertices such that every ball of radius rr contains at most rr of its vertices.

Broadcast domination–multipacking conjecture. For any graph GG,

γb(G)≤2mp(G).{\gamma_b}(G) \leq 2{\mathrm{mp}}(G).

This would remove the additive constant from the paper's bound γb(G)≤2mp(G)+3{\gamma_b}(G) \leq 2{\mathrm{mp}}(G)+3 and would be sharp. The conjecture concerns the gap between the dual parameters of broadcast domination and multipacking; the source gives no resolution.

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.