Akl et al.'s connectivity conjecture for flip graphs of plane spanning paths
Statement
Let be a point set in general position. A plane spanning path on 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.