Enumerating matroids of fixed rank
From MaRDI portal
Publication:510313
zbMath1355.05033arXiv1512.06655MaRDI QIDQ510313
Jorn G. Van der Pol, Rudi A. Pendavingh
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06655
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16)
Related Items (6)
On the Wilson monoid of a pairwise balanced design ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Truncated boolean representable simplicial complexes ⋮ Quotients of uniform positroids ⋮ The number of partial Steiner systems and d-partitions
Cites Work
- On the number of matroids
- An entropy argument for counting matroids
- On the number of matroids compared to the number of sparse paving matroids
- Matroid erection and duality
- Some intersection theorems for ordered sets and graphs
- Random matroids
- Counting designs
- On the number of sparse paving matroids
- On the asymptotic proportion of connected matroids
- A note on the random greedy independent set algorithm
- Lower bounds for constant weight codes
- Monotone Boolean functions
- A Catalogue of Combinatorial Geometries
- On the Number of Combinatorial Geometries
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumerating matroids of fixed rank
