Sivaraman–Testa conjecture on the cop number of induced-path-free graphs
Statement
Let be a connected graph, and let denote the path on vertices. A graph is -free if it has no induced subgraph isomorphic to , and denotes its cop number. Sivaraman–Testa conjecture. For , if is -free, then
This improves by one the previously known bound for connected -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.