Rainbow matching

Rainbow matching is a concept used in graph theory, particularly in the context of bipartite graphs and matching theory. It refers to a specific type of matching where the edges involved in the matching are colored in a variety of colors, and the goal is to find a matching that uses edges of distinct colors. In more detail, a rainbow matching is a matching in which no two edges share the same color.