Rainbow Matchings in Properly Colored Bipartite Graphs
Guanghui Wang, Guizhen Liu · Open Journal of Discrete Mathematics · 2012
Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that if , then G has a rainbow coloring of size at least .