Rainbow matchings and rainbow connectedness

zbMath1355.05203arXiv1504.05373MaRDI QIDQ510322

Alexey Pokrovskiy

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

connectednessLatin squarestransversalsmatchings

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

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, Degree Conditions for Matchability in 3‐Partite Hypergraphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Rainbow structures in locally bounded colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved bound on the sizes of matchings guaranteeing a rainbow matching
• Transversals of latin squares and their generalizations
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• 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
• Orthogonal Latin Rectangles
• Representation of Large Matchings in Bipartite Graphs
• A lower bound for the length of a partial transversal in a Latin square