Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance

Shuhei Saito, Wei Wu, Naoki Matsumoto

Given an edge-colored complete graph $K_n$ on $n$ vertices, a perfect (respectively, near-perfect) matching $M$ in $K_n$ with an even (respectively, odd) number of vertices is rain…