3 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 2 cited
Counting matroids in minor-closed classes
R. A. Pendavingh, J. G. van der Pol
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for t…
math.CO2012★ 3 cited
An entropy argument for counting matroids
N. Bansal, R. A. Pendavingh, J. G. van der Pol
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on elements.