The strong attacking-cop-number conjecture
Statement
Let be a graph, and write for its cop number and for its attacking cop number.
Strong attacking-cop-number conjecture. For all integers there exists a graph such that and
The conjecture asks whether the general upper bound is attained for every cop number at least four. The source states that its truth is unclear and that constructing examples with attacking cop number exceeding the cop number by at least two is nontrivial.
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.