Rainbow Matchings in Properly Colored Multigraphs

DOI10.1137/17M1151742zbMath1391.05209arXiv1710.03041OpenAlexW2962982788WikidataQ129529344 ScholiaQ129529344MaRDI QIDQ3174698

Peter Keevash, Liana Yepremyan

Publication date: 18 July 2018

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

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

zbMATH Keywords

Latin squaresmatchings

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (6)

Full rainbow matchings in graphs and hypergraphs ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ Choice functions ⋮ A rainbow blow‐up lemma ⋮ Repeated Patterns in Proper Colorings ⋮ Graph theory. Abstracts from the workshop held January 6--12, 2019

Cites Work

• Transversals of latin squares and their generalizations
• An approximate version of a conjecture of Aharoni and Berger
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• A lower bound for the length of a partial transversal in a Latin square
• Unnamed Item
• Unnamed Item

This page was built for publication: Rainbow Matchings in Properly Colored Multigraphs