Counting matroids in minor-closed classes

DOI10.1016/j.jctb.2014.10.001zbMath1307.05041arXiv1302.1315OpenAlexW2038849353MaRDI QIDQ2259858

Rudi A. Pendavingh, Jorn G. Van der Pol

Publication date: 5 March 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic complexityasymptotic enumerationmatroidexcluded minor

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On the number of matroids ⋮ An infinite family of excluded minors for strong base-orderability ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ On the number of bases of almost all matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An entropy argument for counting matroids
• The number of points in a matroid with no \(n\)-point line as a minor
• Some open problems on excluding a uniform matroid
• Growth rates of minor-closed classes of matroids
• The asymptotic number of geometries
• On the number of sparse paving matroids
• On minor-closed classes of matroids with exponential growth rate
• On the asymptotic proportion of connected matroids
• Lower bounds for constant weight codes
• On the Number of Combinatorial Geometries

This page was built for publication: Counting matroids in minor-closed classes