1 problem

Let $T_1$ and $T_2$ be trees with an upper bound in the Tamari lattice $\mathscr{C}_n$, and let $\mathscr{R}_n$ be the rotation graph on these trees. A shortest path in…