A Rainbow $k$-Matching in the Complete Graph with $r$ Colors
A Rainbow $k$-Matching in the Complete Graph with $r$ Colors
An $r$-edge-coloring of a graph is an assignment of $r$ colors to the edges of the graph. An exactly $r$-edge-coloring of a graph is an $r$-edge-coloring of the graph that uses all $r$ colors. A matching of an edge-colored graph is called rainbow matching, if no two edges have the …