ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with nn vertices. The cop number c(G)c(G) is the minimum number of cops needed for the Cop Player to have a winning strategy in GG.

Meyniel's conjecture.

c(G)=O(n).c(G)=O(\sqrt{n}).

The conjecture is tight up to the constant factor, since there are connected graphs for which n/2\sqrt{n}/2 cops are insufficient. Even the weaker assertion that O(n1−ε)O(n^{1-\varepsilon}) cops suffice for some ε>0\varepsilon>0 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.