Localization capture time conjecture for connected graphs
Statement
Let be a connected graph, and let denote its localization capture time, namely the minimum number of rounds needed for the minimum number of cops to locate an omniscient robber on . A family of graphs is well-localizable if there exists a constant such that every graph in the family satisfies
Localization Capture Time Conjecture (LCTC). The family of all connected graphs is well-localizable; equivalently, there exists a constant such that every connected graph satisfies
This conjecture seeks a linear upper bound on localization capture time in terms of the number of vertices. Exact bounds are known for several graph families, including trees and outerplanar graphs, but the general connected-graph case remains open.
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.