The broadcast domination–multipacking bound conjecture
Statement
Let be a graph. The broadcast domination number is the minimum cost of a dominating broadcast on , and is the maximum size of a multipacking in . A multipacking is a subset of vertices such that every ball of radius contains at most of its vertices.
Broadcast domination–multipacking conjecture. For any graph ,
This would remove the additive constant from the paper's bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.