AbstractA rainbow subgraph of an edge-colored graph is a subgraph whose edges havedistinct colors. The color degree of a vertex v is the number of different colors onedges incident to v. Wang and Li conjectured that for k > 4, every edge-coloredgraph with minimum color degree at least k contains a rainbow matching of sizeat least ⌈ k/2⌉ . We prove the slightly weaker statement that a rainbow matching ofsize at least ⌊ k/2⌋ is guaranteed. We also give sufficient conditions for a rainbowmatching of size at least ⌈k/2⌉ that fail to hold only for finitely many exceptions(for each odd k)...