On the existence of rainbows in 1-factorizations of K2n

David E. Woolbright; Hung-Lin Fu

doi:10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J

On the existence of rainbows in 1-factorizations of K_2n

David E. Woolbright^*, Hung-Lin Fu

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

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 K_2n, n ≥ 3, we prove there exists a 1-factor of K_2n whose edges have distinct colors. Such a 1-factor is called a "Rainbow."

Original language	English
Pages (from-to)	1-20
Number of pages	20
Journal	Journal of Combinatorial Designs
Volume	6
Issue number	1
DOIs	https://doi.org/10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J
State	Published - 1 Jan 1998

Keywords

1-factor
1-factorization
Edge coloring
Rainbow

Access to Document

10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J

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

@article{2cf396f1287b48b9bc5e1ed8f74abe12,

title = "On the existence of rainbows in 1-factorizations of K2n",

abstract = "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.{"}",

keywords = "1-factor, 1-factorization, Edge coloring, Rainbow",

author = "Woolbright, {David E.} and Hung-Lin Fu",

year = "1998",

month = jan,

day = "1",

doi = "10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J",

language = "English",

volume = "6",

pages = "1--20",

journal = "Journal of Combinatorial Designs",

issn = "1063-8539",

publisher = "John Wiley and Sons Inc.",

number = "1",

}

TY - JOUR

T1 - On the existence of rainbows in 1-factorizations of K2n

AU - Woolbright, David E.

AU - Fu, Hung-Lin

PY - 1998/1/1

Y1 - 1998/1/1

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

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

KW - 1-factor

KW - 1-factorization

KW - Edge coloring

KW - Rainbow

UR - http://www.scopus.com/inward/record.url?scp=27844503094&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J

DO - 10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-J

M3 - Article

AN - SCOPUS:27844503094

VL - 6

SP - 1

EP - 20

JO - Journal of Combinatorial Designs

JF - Journal of Combinatorial Designs

SN - 1063-8539

IS - 1