The endpoint-rooted path conjecture for cover cost-to-time ratio
Statement
Let be a rooted graph on vertices, with root , and let and denote its cover cost and cover time from . The path on vertices rooted at an endpoint maximises the ratio
over all rooted graphs on vertices.
This conjecture concerns extremal comparisons between cover cost and cover time, which can have substantially different orders of magnitude depending on the graph. A proof would provide an extremal bound for using cover cost to estimate cover time; the source gives no 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.