An entropy argument for counting matroids

DOI10.1016/J.JCTB.2014.06.001zbMATH Open1301.05055arXiv1210.6581OpenAlexW2072256150MaRDI QIDQ462939FDOQ462939

Authors: N. Bansal, R. A. Pendavingh, J. G. van der Pol 

Publication date: 22 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on $n$ elements.

Full work available at URL: https://arxiv.org/abs/1210.6581

zbMATH Keywords

entropyenumerationmatroidsShearer's lemma

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Some intersection theorems for ordered sets and graphs
• The asymptotic number of geometries
• On the asymptotic proportion of connected matroids
• An upper bound for the number of matroids
• On the number of matroids
• Improved bounds on Bell numbers and on moments of sums of random variables
• Title not available (Why is that?)

Cited In (5)

• A method to construct all the paving matroids over a finite set
• Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
• Enumerating matroids of fixed rank
• Counting matroids in minor-closed classes
• Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor

This page was built for publication: An entropy argument for counting matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462939)