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

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

2007-11-19

arxiv.org/abs/0711.2847v1

Mathematics

Combinatorics

6 pages

Scientific paper

El-Zanati et al proved that for any 1-factorization $\mathcal{F}$ of the
complete uniform hypergraph $\mathcal {G}=K_{rn}^{(r)}$ with $r\geq 2$ and
$n\geq 3$, there is a rainbow 1-factor. We generalize their result and show
that in any proper coloring of the complete uniform hypergraph $\mathcal
{G}=K_{rn}^{(r)}$ with $r\geq 2$ and $n\geq 3$, there is a rainbow 1-factor.

Affiliated with

Also associated with

No associations

Rating

On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)} does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)}, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)} will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115573