Category: Rainbow problems

Rainbow covering
No description available.
Colorful caratheodory theorem
No description available.
Rainbow matching
In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors.
Rainbow-independent set
In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let G = (V, E) be a graph, and suppose vertex set V is partitio