On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)}

Publication date: 19 November 2007

Abstract: El-Zanati et al proved that for any 1-factorization

m a t h c a l F

of the complete uniform hypergraph

m a t h c a l G = K_{r n}^{(r)}

with

r g e q 2

and

n g e q 3

, there is a rainbow 1-factor. We generalize their result and show that in any proper coloring of the complete uniform hypergraph

m a t h c a l G = K_{r n}^{(r)}

with

r g e q 2

and

n g e q 3

, there is a rainbow 1-factor.

This page was built for publication: On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)}