On the number of matroids
From MaRDI portal
Publication:313452
DOI10.1007/S00493-014-3029-ZzbMATH Open1363.05005OpenAlexW3139013448MaRDI QIDQ313452FDOQ313452
N. Bansal, R. A. Pendavingh, J. 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On the structure of the \(h\)-vector of a paving matroid
- Rota’s Basis Conjecture for Paving Matroids
- Explicit construction of linear sized tolerant networks
- On the number of graphs without 4-cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- The asymptotic number of geometries
- 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
- Title not available (Why is that?)
- A Catalogue of Combinatorial Geometries
- On the Number of Combinatorial Geometries
- Some new distance-4 constant weight codes
- Two remarks concerning balanced matroids
Cited In (32)
- Doubly Exponentially Many Ingleton Matroids
- On the rank of a random binary matrix
- Matroids from hypersimplex splits
- On the Complexity of Some Enumeration Problems for Matroids
- Counting independent sets in graphs
- Secret sharing schemes for ports of matroids of rank 3
- On the number of non-isomorphic matroids
- On the number of transversal matroids
- A combinatorial search problem on matroids
- Title not available (Why is that?)
- Bounding the number of bases of a matroid
- Minors of a random binary matroid
- Matroids are not Ehrhart positive
- 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
- Valuative invariants for large classes of matroids
- An entropy argument for counting matroids
- On the number of matroids on a finite set
- A method to construct all the paving matroids over a finite set
- On the number of bases of almost all matroids
- On the number of matroids
- Approximation Limitations of Pure Dynamic Programming
- Matroid relaxations and Kazhdan-Lusztig non-degeneracy
- Lower bounds on full rank probability in random matroids
- Matroids with different configurations and the same \(\mathcal{G} \)-invariant
- How many delta-matroids are there?
- Enumerating matroids and linear spaces
- Asymptotics of symmetry in matroids
- Delta-matroids as subsystems of sequences of Higgs lifts
- Enumerating matroids of fixed rank
- On matroids with many common bases
- Jump number problem: The role of matroids
This page was built for publication: On the number of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313452)
