Bounded degree graphs and hypergraphs with no full rainbow matchings

Ronen Wdowinski

Given a multi-hypergraph $G$ that is edge-colored into color classes $E_1,\dots ,E_n$, a full rainbow matching is a matching of $G$ that contains exactly one edge from each color…