The 3/2n flip-distance conjecture for non-crossing spanning trees
Statement
Let and be non-crossing spanning trees on the same set of points. A flip replaces one edge of a non-crossing spanning tree by another edge so that the result is again a non-crossing spanning tree. The 3/2n flip-distance conjecture. There is a flip sequence between any pair of non-crossing spanning trees of length at most . This would improve the general upper bound on flip distance and match the known lower bound up to an additive constant; the conjecture remains open, although the bound is proved in several special cases, including when one of the trees is a path or a nice caterpillar.
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.