Lavrov–Loh conjecture on Hamiltonian monotone paths in random edge-orderings
Statement
Let be the complete graph on vertices, choose an edge-ordering of uniformly at random, and call a path Hamiltonian if it contains all vertices of . A path is monotone when it traverses edges in increasing order in the edge-ordering.
Lavrov–Loh conjecture. With probability tending to as , a random edge-ordering of contains a Hamiltonian monotone path.
The conjecture strengthens the result that the probability is at least . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.