On the existence of rainbows in 1-factorizations of K2n

David E. Woolbright*, Hung-Lin Fu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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."

Original languageEnglish
Pages (from-to)1-20
Number of pages20
JournalJournal of Combinatorial Designs
Issue number1
StatePublished - 1 Jan 1998


  • 1-factor
  • 1-factorization
  • Edge coloring
  • Rainbow

Fingerprint Dive into the research topics of 'On the existence of rainbows in 1-factorizations of K<sub>2n</sub>'. Together they form a unique fingerprint.

Cite this