Meyniel's conjecture for the cop number of graphs
Statement
Let be a connected graph with vertices. The cop number is the minimum number of cops needed for the Cop Player to have a winning strategy in .
Meyniel's conjecture.
The conjecture is tight up to the constant factor, since there are connected graphs for which cops are insufficient. Even the weaker assertion that cops suffice for some remains unknown.
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.