ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, choose an edge-ordering of KnK_n uniformly at random, and call a path Hamiltonian if it contains all vertices of KnK_n. A path is monotone when it traverses edges in increasing order in the edge-ordering.

Lavrov–Loh conjecture. With probability tending to 11 as n→∞n\to\infty, a random edge-ordering of KnK_n contains a Hamiltonian monotone path.

The conjecture strengthens the result that the probability is at least 1/e−o(1)1/e-o(1). It asks whether Hamiltonian monotone paths occur with asymptotically overwhelming probability; 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.