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

Simple item page
dc.creatorLi, Xueliang
dc.creatorXu, Zhixia
dc.date2007-11-19
dc.date.accessioned2026-07-07T08:43:41Z
dc.date.available2026-07-07T08:43:41Z
dc.descriptionEl-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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0711.2847
dc.identifierhttp://arxiv.org/abs/0711.2847
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142402
dc.subjectCombinatorics
dc.subject05C15; 05C35; 05C55; 05C70
dc.titleOn the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)}
dc.typetext

Files

Collections

arXiv