ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PkP_k denote the path on kk vertices, let GG be a graph, and let c(G)c(G) denote its cop number. A graph is PkP_k-free if it contains no induced subgraph isomorphic to PkP_k. Sivaraman's conjecture. For all k≥5k\geq 5, if GG is PkP_k-free, then

c(G)≤k−3.c(G)\leq k-3.

The conjecture proposes an improvement over the known bound that every connected PkP_k-free graph is (k−2)(k-2)-cop win. Its general P5P_5 case was recently proved by Chudnovsky, Norin, Seymour, and Turcotte; the statement for general kk is therefore not uniformly open in the same form.

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.