Nearly optimal packings of equally sized rainbow forests

A forest in an edge-colored graph is rainbow if its edges have pairwise distinct colors. We prove that, for every fixed $0<δ<1$, every properly edge-colored simple graph with $km$ edges and color classes of size at most $m$ contains at least $(1-o(1))m$ pairwise edge-disjoint rainbow forests, each w