Rainbow matchings in hypergraphs
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...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/78478 |
| Acceso en línea: | https://hdl.handle.net/2117/78478 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Rainbow Matching Hypergraph Grafs, Teoria de Classificació AMS::05 Combinatorics::05C Graph theory Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| Sumario: | 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. |
|---|