2 problems

Permutation-degree conjecture. The labeling $L$ induces a single-valued labeling $\ell:\operatorname{Vert}(T)\to [n]$ such that

Universal upper-bound conjecture. For every $n$, every set of $n$ value measures, and every entitlement vector $t$, there exists a $t$-proportional allocation with at most $2n-2$ c…