A 1-factor of a graph G = (V, E) is a collection of disjoint edges which contain all the vertices of V. Given a 2n - 1 edge coloring of K2n, n ≥ 3, we prove there exists a 1-factor of K2n whose edges have distinct colors. Such a 1-factor is called a "Rainbow."
|Number of pages||20|
|Journal||Journal of Combinatorial Designs|
|State||Published - 1 Jan 1998|
- Edge coloring