An upper bound for the number of matroids

DOI10.1016/0095-8956(73)90006-3zbMath0258.05026OpenAlexW1998051942MaRDI QIDQ2559385

M. J. Piff

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90006-3

Mathematics Subject Classification ID

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

Related Items

On the number of matroids ⋮ A method to construct all the paving matroids over a finite set ⋮ How many delta-matroids are there? ⋮ The asymptotic number of geometries ⋮ Enumerating matroids and linear spaces ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ An entropy argument for counting matroids

Cites Work

• On the Number of Combinatorial Geometries