ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a rooted graph on nn vertices, with root rr, and let ccr(G)cc_r(G) and CTr(G)CT_r(G) denote its cover cost and cover time from rr. The path on nn vertices rooted at an endpoint maximises the ratio

ccr(G)CTr(G)\frac{cc_r(G)}{CT_r(G)}

over all rooted graphs GG on nn 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.