3 citations · 5 across the 3 of their papers we have counts for
4 papers
On the number of biased graphs
Peter Nelson, Jorn van der Pol
A biased graph is a graph , together with a distinguished subset of its cycles so that no Theta-subgraph of contains precisely two cycles in . A l…
Doubly exponentially many Ingleton matroids
Peter Nelson, Jorn van der Pol
A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of I…
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…
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.