ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, and let PtP_t denote the path on tt vertices. A graph is PtP_t-free if it has no induced subgraph isomorphic to PtP_t, and c(G)c(G) denotes its cop number. Sivaraman–Testa conjecture. For t≥5t\geq 5, if GG is PtP_t-free, then

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

This improves by one the previously known bound c(G)≤t−2c(G)\leq t-2 for connected PtP_t-free graphs. The conjecture is presented as an improvement of that bound; its resolution is not specified in the supplied text.

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.