1 problem

For positive integers $n$ and $t$, let $r(n,t)$ be the maximum number of colors in an edge-coloring of $K_n$ that has no $t$ edge-disjoint rainbow spanning trees. Jahanbekam–West c…