On the Number of Combinatorial Geometries

DOI10.1112/blms/3.1.55zbMath0222.05003OpenAlexW2035655704MaRDI QIDQ5626670

M. J. Piff, Dominic J. A. Welsh

Publication date: 1971

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/3.1.55

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of finite geometries (05B25)

Related Items (15)

On the number of matroids ⋮ 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 ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ Enumerating matroids of fixed rank ⋮ Counting matroids in minor-closed classes ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ Matroid basis graphs. I ⋮ An upper bound for the number of matroids ⋮ Approximately counting bases of bicircular matroids ⋮ A Catalogue of Combinatorial Geometries ⋮ Construction methods for gaussoids ⋮ On the problem of approximating the number of bases of a matroid

This page was built for publication: On the Number of Combinatorial Geometries