1 problem

Let $k\geq 3$, and color the edges of the complete graph $K_{2k}$ so that each color class forms a perfect matching. A spanning tree is rainbow colored if no two of its edges have…