ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, and let c(G)c(G) denote its cop number. Weak Meyniel's conjecture. There exists an ε>0\varepsilon>0 such that

c(G)=O(n1−ε).c(G)=O(n^{1-\varepsilon}).

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 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.