Enumerating Matroids of Fixed Rank

Electronic Journal Of Combinatorics

Rudi Pendavingh¹ 

关键词: Matroid theory;    Asymptotic enumeration;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others