On rainbow matchings in bipartite graphs
type: Item
instance of: scholarly article
title: On rainbow matchings in bipartite graphs
zbMATH Open document ID: 1356.05044
author: Ron Aharoni
author: Eli Berger
author: Dani Kotlar
author: Ran Ziv
publication date: 2017-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6683928
zbMATH Keywords: partial rainbow matching
zbMATH Keywords: full rainbow matching
zbMATH Keywords: bipartite graph
zbMATH Keywords: Ryser-Brualdi conjecture
zbMATH Keywords: Stein's conjecture
MaRDI profile type: Publication
full work available at URL: j.endm.2016.09.007
OpenAlex ID: W2533448905
cites work: Rainbow matchings in \(r\)-partite \(r\)-graphs
cites work: Degree Conditions for Matchability in 3‐Partite Hypergraphs
cites work: Independent systems of representatives in weighted graphs
cites work: Hall's theorem for hypergraphs
cites work: Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
cites work: Rainbow matchings in bipartite multigraphs
cites work: Q4177580
cites work: Combinatorial matrix theory
cites work: Covering radius for sets of permutations
cites work: Transversals in row-latin rectangles
cites work: A lower bound for the length of a partial transversal in a Latin square
cites work: Domination numbers and homology
cites work: Transversals of latin squares and their generalizations
cites work: An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
DOI: 10.1016/J.ENDM.2016.09.007
description: scientific article; zbMATH DE number 6683928