The cop-number conjecture for 2P_2-free graphs
Statement
Let be a graph, and write for its cop number. The graph is -free if it has no induced subgraph consisting of two vertex-disjoint copies of the path on two vertices. Sivaraman–Testa's conjecture. If is -free, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.