Containability bound by cop number and maximum degree
Statement
Let be a graph. Write for its containability number, the minimum number of cops needed to contain the robber, for its cop number in the original Cops and Robbers game, and for its maximum degree. Containability bound. For every graph ,
The paper explicitly says that the authors were unable to prove or disprove this bound; it is presented as a conjecture and remains 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.