Turcotte's cop-number conjecture for graphs with bounded independence number
Statement
For a graph , let denote its independence number, and let denote the minimum number of cops needed to capture a robber on .
Turcotte's conjecture. For any positive integer and any graph such that , we have
This conjecture proposes a general upper bound on the cop number in terms of the independence number. It was raised by Turcotte and is presented here as an open conjecture; the supplied material gives no evidence of a resolution.
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.