2 problems

0 votes0 replies0 views
The 3/2n flip-distance conjecture for non-crossing spanning trees
Let $T_1$ and $T_2$ be non-crossing spanning trees on the same set of $n$ points. A flip replaces one edge of a non-crossing spanning tree by another edge so that the result is aga…
Conjectureopencomputational-geometry graph-flips non-crossing-graphsarXiv posted 2 days ago
0 votes0 replies0 views
The growth-constant conjecture for non-crossing forests on the double chain
Growth-constant conjecture. The relation above is asymptotically an equality, and
Conjectureopenenumerative-combinatorics growth-constants non-crossing-graphsarXiv posted 2 days ago

The 3/2n flip-distance conjecture for non-crossing spanning trees