Sivaraman's cop-number conjecture for path-free graphs
Statement
Let denote the path on vertices, let be a graph, and let denote its cop number. A graph is -free if it contains no induced subgraph isomorphic to . Sivaraman's conjecture. For all , if is -free, then
The conjecture proposes an improvement over the known bound that every connected -free graph is -cop win. Its general case was recently proved by Chudnovsky, Norin, Seymour, and Turcotte; the statement for general 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.