Rainbow sets in the intersection of two matroids

DOI10.1016/J.JCTB.2016.01.002zbMath1332.05027arXiv1405.3119OpenAlexW2129248989MaRDI QIDQ256994

Daniel Kotlar, Ran Ziv, Ron Aharoni

Publication date: 14 March 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

transversalmatroid intersectionmatroidal Latin squaresrainbow independent sets

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matroids and geometric lattices (05B35) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

An improved bound on the sizes of matchings guaranteeing a rainbow matching ⋮ Large matchings in bipartite graphs have a rainbow matching ⋮ Fair representation in dimatroids ⋮ Rainbow sets in the intersection of two matroids: a generalization of results of Drisko and Chappell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the length of a partial independent transversal in a matroidal Latin square
• Transversals of latin squares and their generalizations
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• A matroid generalization of a result on row-Latin rectangles
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Groups of orthogonal row-latin squares
• 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 sets in the intersection of two matroids