Weak Meyniel's conjecture on the cop number of arbitrary graphs
Statement
Let be a graph of order , and let denote its cop number. Weak Meyniel's conjecture. There exists an such that
This weaker form of Meyniel's conjecture, also known as the Soft Meyniel conjecture, remains widely open and seeks a sublinear upper bound on the cop number of every graph.
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.