Large rainbow matchings in general graphs
DOI10.1016/j.ejc.2019.01.012zbMath1414.05235arXiv1611.03648OpenAlexW2962857703WikidataQ128141175 ScholiaQ128141175MaRDI QIDQ2422240
Eli Berger, Maria Chudnovsky, P. D. Seymour, David M. Howard, Ron Aharoni
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03648
Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Distance in graphs (05C12)
Related Items (16)
Cites Work
- Rainbow matchings in bipartite multigraphs
- A topological colorful Helly theorem
- Transversals in row-latin rectangles
- Rainbow fractional matchings
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
- Degree Conditions for Matchability in 3‐Partite Hypergraphs
- Paths, Trees, and Flowers
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Large rainbow matchings in general graphs