ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Write ξ(G)\xi(G) for its containability number, the minimum number of cops needed to contain the robber, c(G)c(G) for its cop number in the original Cops and Robbers game, and Δ(G)\Delta(G) for its maximum degree. Containability bound. For every graph GG,

ξ(G)≤Δ(G)c(G).\xi(G)\leq \Delta(G)c(G).

The paper explicitly says that the authors were unable to prove or disprove this bound; it is presented as a conjecture and remains open.

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.