Rainbow matchings in hypergraphs

View/Open
Document typeMaster thesis
Date2015-10
Rights accessOpen Access
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
Abstract
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.
DegreeMÀSTER UNIVERSITARI EN MATEMÀTICA AVANÇADA I ENGINYERIA MATEMÀTICA (Pla 2010)
Files | Description | Size | Format | View |
---|---|---|---|---|
memoria.pdf | 1,608Mb | View/Open |