Premium
On the existence of rainbows in 1‐factorizations of K 2 n
Author(s) -
Woolbright David E.,
FU HungLin
Publication year - 1998
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1998)6:1<1::aid-jcd1>3.0.co;2-j
Subject(s) - combinatorics , mathematics , disjoint sets , rainbow , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , physics , optics , artificial intelligence
A 1‐factor of a graph G = ( V , E ) is a collection of disjoint edges which contain all the vertices of V . Given a 2 n ‐ 1 edge coloring of K 2 n , n ≥ 3, we prove there exists a 1‐factor of K 2 n whose edges have distinct colors. Such a 1‐factor is called a “Rainbow.” © 1998 John Wiley & Sons, Inc. J Combin Designs 6:1–20, 1998