An entropy argument for counting matroids
From MaRDI portal
Publication:462939
DOI10.1016/j.jctb.2014.06.001zbMath1301.05055arXiv1210.6581OpenAlexW2072256150MaRDI QIDQ462939
Rudi A. Pendavingh, Nikhil Bansal, Jorn G. Van der Pol
Publication date: 22 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6581
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (4)
A method to construct all the paving matroids over a finite set ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Enumerating matroids of fixed rank ⋮ Counting matroids in minor-closed classes
Cites Work
This page was built for publication: An entropy argument for counting matroids