The polynomial noncrossing-path conjecture
Statement
A complete -vertex simple topological graph is a drawing of the complete graph on 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 such that every complete -vertex simple topological graph contains a noncrossing path on vertices. The conjecture would improve the known lower bound of order 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.