The planar attacking cop number conjecture
Statement
A planar graph is a graph admitting a planar embedding. For a graph , let denote its cop number and let denote its attacking cop number.
Planar attacking cop number conjecture. For every planar graph ,
The conjecture would imply that all planar graphs have attacking cop number at most once combined with the paper's established bounds. The source gives no resolution of this conjecture.
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.