A rainbow $k$-matching in the complete graph with $r$ colors.

Fujita, Shinya, et al. "A rainbow -matching in the complete graph with colors.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R51, 13 p.-Research Paper R51, 13 p.. <http://eudml.org/doc/117512>.

@article{Fujita2009,
author = {Fujita, Shinya, Kaneko, Atsushi, Schiermeyer, Ingo, Suzuki, Kazuhiro},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {edge-coloring; rainbow matching; complete graph; anti-Ramsey; heterochromatic; totally multicolored},
language = {eng},
number = {1},
pages = {Research Paper R51, 13 p.-Research Paper R51, 13 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A rainbow -matching in the complete graph with colors.},
url = {http://eudml.org/doc/117512},
volume = {16},
year = {2009},
}

TY - JOUR
AU - Fujita, Shinya
AU - Kaneko, Atsushi
AU - Schiermeyer, Ingo
AU - Suzuki, Kazuhiro
TI - A rainbow -matching in the complete graph with colors.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R51, 13 p.
EP - Research Paper R51, 13 p.
LA - eng
KW - edge-coloring; rainbow matching; complete graph; anti-Ramsey; heterochromatic; totally multicolored
UR - http://eudml.org/doc/117512
ER -