The trap bound for restricted cop number in diameter-two graphs
Statement
Let be a diameter- graph, let be a subgraph, and let denote the least number of ordinary cops needed to catch a robber restricted to , while the cops may move along all edges of . Call an -trap when the robber can be caught under the corresponding trap condition with parameter .
Restricted cop-number trap conjecture. If is an -trap in , then
The paper says this conjecture could be used to improve the upper bounds, but gives no proof or counterexample.
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.