Enumerating Matroids of Fixed Rank

[摘要] It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that~$s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In an earlier pap

[学科分类] 离散数学和组合数学

[关键词] Matroid theory;Asymptotic enumeration