A rainbow matching in an edge colored multihypergraph is a matching consisting of edges with pairwise distinct colors. In this master thesis we give an overview of the results about having a rainbow matching in edge-colored bipartite graphs and edge colored r-partite r-uniform hypergraphs. Having in mind the techniques that are used in the last results we aplied them and we get some new approaches using the Local Lovasz Lemma.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org