Rainbow decompositions

A rainbow coloring of a graph is a coloring of the edges with distinct colors. We prove the following extension of Wilson's Theorem. For every integer there exists an so that for all , if

then every properly edge-colored contains pairwise edge-disjoint rainbow copies of .

Our proof uses, as a main ingredient, a double application of the probabilistic method.