ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, and let CE(Kn)C_E(K_n) denote the edge cover time of greedy random walk. The expected edge cover time is conjectured to satisfy

Linear overhead conjecture.

E[CE(Kn)]=∣E∣+Θ(n).\mathbb{E}[C_E(K_n)]=|E|+\Theta(n).

Thus the overhead beyond traversing all edges is conjectured to be linear in the number of vertices. The paper explains that the available argument gives an O(nlog⁡n)O(n\log n) bound, whereas linear growth of the relevant bad sets would yield an O(n)O(n) overhead; the conjecture is presented as a stronger expected bound for the complete graph.

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.