The square-root bound for the cop number of diameter-two graphs
Statement
Let be a graph of diameter and order , and let denote its cop number.
Square-root bound conjecture. One should have
The paper proves the weaker bound and notes that Moore graphs have cop number , so this conjecture would be close to best possible.
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.