On the number of matroids compared to the number of sparse paving matroids

zbMath1327.05056arXiv1411.0935MaRDI QIDQ491548

Jorn G. Van der Pol, Rudi A. Pendavingh

Publication date: 26 August 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.0935

zbMATH Keywords

asymptotic enumerationmatroid theory

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16)

Related Items (14)

A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids ⋮ Matroids are not Ehrhart positive ⋮ Unnamed Item ⋮ Paving tropical ideals ⋮ Ehrhart theory of paving and panhandle matroids ⋮ Equivariant Kazhdan-Lusztig theory of paving matroids ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Asymptotics of symmetry in matroids ⋮ List Coloring of Two Matroids through Reduction to Partition Matroids ⋮ Enumerating matroids of fixed rank ⋮ On the number of bases of almost all matroids ⋮ Complexity of packing common bases in matroids ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ The number of partial Steiner systems and d-partitions

Cites Work

• Unnamed Item
• On the number of matroids
• On the number of graphs without 4-cycles
• On properties of almost all matroids
• On the number of sparse paving matroids
• Counting sum-free sets in abelian groups
• On the asymptotic proportion of connected matroids
• Counting independent sets in graphs
• Extremal Combinatorics
• Lower bounds for constant weight codes
• A Catalogue of Combinatorial Geometries
• On the Number of Combinatorial Geometries
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

This page was built for publication: On the number of matroids compared to the number of sparse paving matroids