| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423693 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
A matching M in an edge-colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of ErdÅs and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite multigraphs, dense regular bipartite graphs and complete r-partite r-uniform hypergraphs. The proof of the results use the Lopsided version of the Local Lovász Lemma.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pilar Cano, Guillem Perarnau, Oriol Serra,