On the number of matroids

DOI10.1007/s00493-014-3029-zzbMath1363.05005OpenAlexW3139013448MaRDI QIDQ313452

Nikhil Bansal, Rudi A. Pendavingh, Jorn G. Van der Pol

Publication date: 9 September 2016

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-014-3029-z

zbMATH Keywords

Johnson graphmatroidKnuth's lower boundlocal coverPiff's upper boundsparse paving matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (21)

Matroids from hypersimplex splits ⋮ Matroids are not Ehrhart positive ⋮ Unnamed Item ⋮ A method to construct all the paving matroids over a finite set ⋮ Doubly Exponentially Many Ingleton Matroids ⋮ Matroids with different configurations and the same \(\mathcal{G} \)-invariant ⋮ Matroid relaxations and Kazhdan-Lusztig non-degeneracy ⋮ How many delta-matroids are there? ⋮ Enumerating matroids and linear spaces ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Asymptotics of symmetry in matroids ⋮ An entropy argument for counting matroids ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ Enumerating matroids of fixed rank ⋮ Delta-matroids as subsystems of sequences of Higgs lifts ⋮ On the number of bases of almost all matroids ⋮ Minors of a random binary matroid ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ On the rank of a random binary matrix ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Counting independent sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of the \(h\)-vector of a paving matroid
• Some new distance-4 constant weight codes
• Spectra of graphs
• Two remarks concerning balanced matroids
• Explicit construction of linear sized tolerant networks
• On the number of graphs without 4-cycles
• The asymptotic number of geometries
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the number of sparse paving matroids
• Counting sum-free sets in abelian groups
• Counting matroids in minor-closed classes
• On the asymptotic proportion of connected matroids
• Matroids with nine elements
• An upper bound for the number of matroids
• IS THE MISSING AXIOM OF MATROID THEORY LOST FOREVER?
• Lower bounds for constant weight codes
• A Catalogue of Combinatorial Geometries
• Rota’s Basis Conjecture for Paving Matroids
• On the Number of Combinatorial Geometries

This page was built for publication: On the number of matroids