On the intersection conjecture for infinite trees of matroids

2014/04/24 by Nathan Bowler, Bowler, Nathan, Johannes Carmesin +1
Mathematics · #03E60 #05B35 #05C63 #Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO) #math.CO #math.LO #msc:03E60 #msc:05B35 #msc:05C63

paper · pdf · doi:10.48550/arxiv.1404.6067

arxiv created 2014/04/24 · arxiv updated 2014/04/25

Abstract

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Related

• Intersection of a partitional and a general infinite matroid
• The matroid intersection conjecture
• On the intersection of infinite matroids
• A Lower Bound for the Rank of Matroid Intersection
• Matroid intersection, base packing and base covering for infinite matroids