Topological methods for the existence of a rainbow matching

DOI10.1016/j.endm.2017.11.046zbMath1383.05088OpenAlexW2774697480MaRDI QIDQ2413401

Dani Kotlar, Eli Berger, Ron Aharoni, Ran Ziv

Publication date: 10 April 2018

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

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)

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
• On a conjecture of Stein
• 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
• On the Strong Chromatic Number
• A lower bound for the length of a partial transversal in a Latin square
• Research problems

This page was built for publication: Topological methods for the existence of a rainbow matching