A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes

Felix Hommelsheim, Pia Jehmlich, Moritz Mühlenthaler

Given an edge-colored graph, the Maximum Rainbow Matching problem asks for a maximum-cardinality matching of the graph that contains at most one edge from each color. We provide th…