ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and write c(G)c(G) for its cop number. The graph GG is 2P22P_2-free if it has no induced subgraph consisting of two vertex-disjoint copies of the path on two vertices. Sivaraman–Testa's conjecture. If GG is 2P22P_2-free, then

c(G)≤2.c(G)\leq 2.

The surrounding text identifies this as another conjecture of Sivaraman and Testa and says that the paper answers the cited conjectures only partially; no resolution of this assertion is supplied here.

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.