ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A complete nn-vertex simple topological graph is a drawing of the complete graph on nn vertices in which vertices are points and edges are simple curves, with no edge passing through a nonincident vertex and with any two edges meeting at most once. A noncrossing path is a path whose edges do not cross. Polynomial noncrossing-path conjecture. There is an absolute constant ε>0\varepsilon>0 such that every complete nn-vertex simple topological graph contains a noncrossing path on nεn^{\varepsilon} vertices. The conjecture would improve the known lower bound of order log⁡nlog⁡log⁡n\frac{\log n}{\log\log n} for noncrossing paths; the source states 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.