Minors of asymptotically almost all sparse paving matroids

2016/05/09 by Critchlow, Will
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1605.02414

Abstract

We use counting arguments to show that asymptotically almost all sparse paving matroids contain an H-minor, where H falls into one of several simple classes of matroids. Furthermore the result holds for all H in a larger class of matroids, if we restrict to asymptotically almost all sparse paving matroids of fixed rank r (where r is necessarily no smaller than the rank of H).

Related

• On the number of bases of almost all matroids
• On the number of matroids compared to the number of sparse paving matroids
• Enumerating matroids of fixed rank
• Counting matroids in minor-closed classes
• A Method to construct the Sparse-paving Matroids over a Finite Set