ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a diameter-22 graph, let H⊆GH\subseteq G be a subgraph, and let cG(H)c_G(H) denote the least number of ordinary cops needed to catch a robber restricted to HH, while the cops may move along all edges of GG. Call HH an ss-trap when the robber can be caught under the corresponding trap condition with parameter ss.

Restricted cop-number trap conjecture. If HH is an ss-trap in GG, then

cG(H)≤s.c_G(H)\leq s.

The paper says this conjecture could be used to improve the upper bounds, but gives no proof or counterexample.

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.