3 problems

Let $S$ be a convex point set, and let $T_{\text{in}}$ and $T_{\text{tar}}$ be plane spanning trees on $S$. A parking edge is an edge appearing in a flip sequence that is not conta…

Let $S$ be a convex point set, and let $T_{\text{in}}$ and $T_{\text{tar}}$ be plane spanning trees on $S$. An edge is happy if it belongs to both $T_{\text{in}}$ and…

Let $S$ be a convex point set with $n$ points, and consider the flip graph of plane spanning trees on $S$. Diameter conjecture. Its diameter is at most … The conjecture concerns th…