Recommendations
Cites work
- scientific article; zbMATH DE number 3668628 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 922670 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- A Catalogue of Combinatorial Geometries
- An upper bound for the number of matroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Counting matroids in minor-closed classes
- Counting sum-free sets in abelian groups
- Explicit construction of linear sized tolerant networks
- Is the missing axiom of matroid theory lost forever?
- Lower bounds for constant weight codes
- Matroids with nine elements
- On the Number of Combinatorial Geometries
- On the asymptotic proportion of connected matroids
- On the number of graphs without 4-cycles
- On the number of sparse paving matroids
- On the structure of the \(h\)-vector of a paving matroid
- Rota’s Basis Conjecture for Paving Matroids
- Some new distance-4 constant weight codes
- Spectra of graphs
- The asymptotic number of geometries
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Two remarks concerning balanced matroids
Cited in
(43)- Approximation limitations of pure dynamic programming
- On properties of almost all matroids
- On the rank of a random binary matrix
- Matroids from hypersimplex splits
- On the Complexity of Some Enumeration Problems for Matroids
- Query complexity of matroids
- Counting independent sets in graphs
- On the number of non-isomorphic matroids
- On complete classes of valuated matroids
- On the number of transversal matroids
- A combinatorial search problem on matroids
- Dominic Welsh, 1938--2023
- Matroids are not Ehrhart positive
- Minors of a random binary matroid
- Bounding the number of bases of a matroid
- 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
- Secret sharing schemes for ports of matroids of rank 3.
- An entropy argument for counting matroids
- Minors of matroids represented by sparse random matrices over finite fields
- Dominic Welsh: his work and influence
- On the number of matroids on a finite set
- A method to construct all the paving matroids over a finite set
- Doubly exponentially many ingleton matroids
- On the number of bases of almost all matroids
- On the sizes of BDDs and ZDDs representing matroids
- A primer on delta-matroids and multimatroids
- On the number of matroids
- On the number of matroids
- Balance in random signed intersection graphs
- Matroid relaxations and Kazhdan-Lusztig non-degeneracy
- Lower bounds on full rank probability in random matroids
- How many delta-matroids are there?
- Matroids with different configurations and the same \(\mathcal{G} \)-invariant
- Enumerating matroids and linear spaces
- On the number of sparse paving matroids
- Asymptotics of symmetry in matroids
- Delta-matroids as subsystems of sequences of Higgs lifts
- Enumerating matroids of fixed rank
- Hilbert-Poincaré series of matroid Chow rings and intersection cohomology
- 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)
