a subgraph of an edge colored graph is called rainbow if each edge has a distinct color. brualdi and hollingsworth proved that in any edge coloring of a complete graph by perfect matchings, there are two edge disjoint rainbow spanning trees and conjectured that a full partition into rainbow spanning trees is possible (for $k_{2n}$ , where $n ? 3$). kaneko, kano, and suzuki proved that one may always find three edge disjoint rainbow spanning trees. in this talk, we show that in this situation a constant fraction of the graph can be covered by edge disjoint rainbow spanning trees. we'll discuss some of the main challenges and ideas in the proof, and an extension of the conjecture by kaneko, kano, and suzuki that considers all proper edge colorings and not just those by perfect matchings.