A matroidal generalization of results of Drisko and Chappell

2014/07/28 by Daniel Kotlar, Kotlar, Daniel, Ziv Ran +2
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1407.7321

arxiv created 2014/07/28 · openalex publication_date 2014/07/28 · arxiv updated 2014/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let M and N be two matroids on the same ground set. We generalize results of Drisko and Chapell by showing that any 2n-1 sets of size n in M ∩ N have a rainbow set of size n in M ∩ N.

Citations

• Rainbow sets in the intersection of two matroids

Related

• A common generalization to strengthenings of Drisko's Theorem for intersections of two matroids
• Rainbow sets in the intersection of two matroids
• Rainbow bases in matroids
• Rainbow and monochromatic circuits and cuts in binary matroids
• Rainbow Stars and Rota's Basis Conjecture for Graphic Matroids