ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a point set in general position. A plane spanning path on SS is a noncrossing straight-line spanning path, and the flip graph has these paths as vertices, with adjacency defined by a flip. Akl et al.'s conjecture. The flip graph of plane spanning paths on SS is connected. Connectivity is known for convex point sets and for point sets with at most two convex layers, but remains open for point sets in general position.

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.