ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T1T_1 and T2T_2 be non-crossing spanning trees on the same set of nn 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 32n\frac{3}{2}n. 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 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.