Perfect distance-dominating set conjecture for integer grids
Statement
Let be the integer grid with vertex set , with adjacency given by Lee distance . Let be the path on vertices, and let an -PDDS mean an -perfect distance-dominating set whose components are isomorphic to .
Perfect distance-dominating set conjecture. For , there is no -PDDS in for and , with the exception of a -PDDS in .
This conjecture simultaneously extends the Golomb–Welch and diameter-perfect Lee-code questions. The stated exception corresponds to the known construction, while the remaining nonexistence claims are 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.