On rainbow matchings in bipartite graphs

DOI10.1016/j.endm.2016.09.007zbMath1356.05044OpenAlexW2533448905MaRDI QIDQ510529

Ran Ziv, Ron Aharoni, Eli Berger, Dani Kotlar

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.007

zbMATH Keywords

bipartite graphStein's conjecturefull rainbow matchingpartial rainbow matchingRyser-Brualdi conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Coloring by two-way independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow matchings in bipartite multigraphs
• 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
• Domination numbers and homology
• Covering radius for sets of permutations
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
• Independent systems of representatives in weighted graphs
• Hall's theorem for hypergraphs
• Degree Conditions for Matchability in 3‐Partite Hypergraphs
• A lower bound for the length of a partial transversal in a Latin square

This page was built for publication: On rainbow matchings in bipartite graphs