Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching

Georgios Stamoulis

We study the rainbow matching (RM) problem: given an edge-colored graph, find a maximum matching with at most one edge of each color. Rainbow matchings correspond to stable sets in…