Representation of Large Matchings in Bipartite Graphs

DOI10.1137/16M1062958zbMath1368.05116arXiv1601.00943MaRDI QIDQ5348494

Dani Kotlar, Ran Ziv, Ron Aharoni

Publication date: 18 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

transversalrainbow matchingbipatite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Transversal (matching) theory (05D15)

Related Items (7)

Full rainbow matchings in graphs and hypergraphs ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ Fair representation in the intersection of two matroids ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Rainbow matchings and rainbow connectedness ⋮ Rainbow paths and large rainbow matchings ⋮ From one to many rainbow Hamiltonian cycles

Cites Work

• An improved bound on the sizes of matchings guaranteeing a rainbow matching
• Rainbow matchings and connectedness of coloured graphs
• On sets not belonging to algebras and rainbow matchings in graphs
• Transversals of latin squares and their generalizations
• 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

This page was built for publication: Representation of Large Matchings in Bipartite Graphs