An entropy argument for counting matroids

Abstract

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

Short note, 4 pages

Cited by in corpus (3)

• Counting matroids in minor-closed classes
• A Method to construct the Sparse-paving Matroids over a Finite Set
• A Method to construct all the Paving Matroids over a Finite Set