On the Number of Bases of Almost All Matroids
Our argument is based on a refined method for writing compressed descriptions of any given matroid, which allows bounding the number of matroids in a class relative to the number of sparse paving matroids.
Mathematics Subject Classification (2000)05B35 05A16
Unable to display preview. Download preview PDF.
- W. Critchlow: Minors of asymptotically almost all sparse paving matroids, preprint, available on arXiv:1605.02414, 2016.Google Scholar
- J. Geelen, B. Gerards and G. Whittle: Solving Rota's conjecture, Notices of the AMS 61 (2014).Google Scholar
- P. Nelson: Almost all matroids are non-representable, Preprint, avaible on arXiv:1605.04288v2, 2016.Google Scholar
- R. Pendavingh and J. van der Pol: On the number of matroids compared to the number of sparse paving matroids, Electron. J. Combin. 22 (2015), Paper 2.51.Google Scholar