An improved bound on the sizes of matchings guaranteeing a rainbow matching

zbMath1335.05137arXiv1503.00438MaRDI QIDQ281599

Dennis Clemens, Julia Ehrenmüller

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00438

zbMATH Keywords

bipartite graphsrainbow matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (9)

Full rainbow matchings in graphs and hypergraphs ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ On sets not belonging to algebras and rainbow matchings in graphs ⋮ Fair representation in the intersection of two matroids ⋮ Representation of Large Matchings in Bipartite Graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Rainbow matchings and rainbow connectedness ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ Rainbow paths and large rainbow matchings

Cites Work

• Rainbow sets in the intersection of two matroids
• Transversals of latin squares and their generalizations
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• Transversals in row-latin rectangles
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Large matchings in bipartite graphs have a rainbow matching
• On a Generalization of the Ryser-Brualdi-Stein Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved bound on the sizes of matchings guaranteeing a rainbow matching