3 problems

Let $\mathcal T_m$ denote the set of labeled trees on $[m]=\{1,\ldots,m\}$. For $T\in\mathcal T_n$ and $U\in\mathcal T_m$, write $T\preceq U$ if $U$ displays $T$, meaning that $T$…

UGVL characterization conjecture. The following statements are equivalent:

Metric characterization conjecture. The following statements are equivalent: