Rainbow matchings in bipartite multigraphs
From MaRDI portal
Publication:524181
DOI10.1007/s10998-016-0172-xzbMath1399.05177arXiv1505.01779OpenAlexW2131641564MaRDI QIDQ524181
János Barát, Gábor N. Sárközy, András Gyárfás
Publication date: 25 April 2017
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.01779
Related Items (20)
Full rainbow matchings in graphs and hypergraphs ⋮ Rainbow independent sets in graphs with maximum degree two ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv ⋮ Topological methods for the existence of a rainbow matching ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Rainbow independent sets in certain classes of graphs ⋮ Large rainbow matchings in general graphs ⋮ Choice functions ⋮ Graph and hypergraph packing ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ A system of disjoint representatives of line segments with given \(k\) directions ⋮ On rainbow matchings in bipartite graphs ⋮ Badges and rainbow matchings ⋮ Complexes of graphs with bounded independence number ⋮ Complexes of graphs with bounded independence number ⋮ Rainbow pancyclicity in graph systems ⋮ Rainbow paths and large rainbow matchings ⋮ Anchored Hyperspaces and Multigraphs.
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Large matchings in bipartite graphs have a rainbow matching
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- A lower bound for the length of a partial transversal in a Latin square
- A lower bound for the length of a partial transversal in a Latin square
This page was built for publication: Rainbow matchings in bipartite multigraphs
