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."
|頁（從 - 到）||1-20|
|期刊||Journal of Combinatorial Designs|
|出版狀態||Published - 1 一月 1998|