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

zbMATH Keywords

difference setstransversalcomplete mappingsrow-Latin rectangle

Mathematics Subject Classification ID

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 (17)

Leray numbers of complexes of graphs with bounded matching number ⋮ Full rainbow matchings in graphs and hypergraphs ⋮ Rainbow independent sets on dense graph classes ⋮ Rainbow independent sets in graphs with maximum degree two ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Rainbow independent sets in certain classes of graphs ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ Choice functions ⋮ On a rainbow version of Dirac's theorem ⋮ A system of disjoint representatives of line segments with given \(k\) directions ⋮ Badges and rainbow matchings ⋮ Rainbow Pancyclicity in a Collection of Graphs Under the Dirac-type Condition ⋮ 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 ⋮ Choice functions in the intersection of matroids

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