On the Number of Matroids Compared to the Number of Sparse Paving Matroids

Electronic Journal Of Combinatorics

Rudi Pendavingh¹ 

关键词: Matroid theory;    Asymptotic enumeration;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\lim_{n\rightarrow\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and $s_n$ the number

【 授权许可】

Others