Abstract
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 k there exists an n0 = n0(k) so that for all n > n 0, if n mod k(k - 1) ε {1, k}, then every properly edge-colored Kn contains (n/2)/(k/2) pairwise edge-disjoint rainbow copies of Kk. Our proof uses, as a main ingredient, a double application of the probabilistic method.
Original language | English |
---|---|
Pages (from-to) | 771-779 |
Number of pages | 9 |
Journal | Proceedings of the American Mathematical Society |
Volume | 136 |
Issue number | 3 |
DOIs | |
State | Published - Mar 2008 |
ASJC Scopus subject areas
- Mathematics (all)
- Applied Mathematics