Rainbow perfect matchings in \(r\)-partite graph structures
From MaRDI portal
Publication:510578
DOI10.1016/j.endm.2016.09.034zbMath1356.05105OpenAlexW2538712489MaRDI QIDQ510578
Guillem Perarnau, Oriol Serra, Pilar Cano
Publication date: 13 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.034
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- How many colors guarantee a rainbow matching?
- Multicolored matchings in hypergraphs
- A note on large rainbow matchings in edge-coloured graphs
- Lopsided Lovász Local lemma and Latin transversals
- Ryser's conjecture for tripartite 3-graphs
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Large Rainbow Matchings in Edge-Coloured Graphs
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- Hall's theorem for hypergraphs
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
- A lower bound for the length of a partial transversal in a Latin square
This page was built for publication: Rainbow perfect matchings in \(r\)-partite graph structures
