Rainbow spanning trees in properly coloured complete graphs

Independently, Pokrovskiy and Sudakov recently proved that every properly edge-coloured Kn contains Ω(n) isomorphic pairwise edge-disjoint rainbow spanning trees.