On the number of bases of almost all matroids

DOI10.1007/s00493-016-3594-4zbMath1424.05042arXiv1602.04763OpenAlexW2964032948WikidataQ129718415 ScholiaQ129718415MaRDI QIDQ1786054

Jorn G. Van der Pol, Rudi A. Pendavingh

Publication date: 24 September 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

matroidsbases

Mathematics Subject Classification ID

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 (3)

Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Asymptotics of symmetry in matroids ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of matroids
• On the number of matroids compared to the number of sparse paving matroids
• On excluded minors for real-representability
• Some intersection theorems for ordered sets and graphs
• On the number of graphs without 4-cycles
• The asymptotic number of geometries
• Constructing a 3-tree for a 3-connected matroid
• Counting matroids in minor-closed classes
• On the asymptotic proportion of connected matroids
• Counting independent sets in graphs
• Solving Rota's Conjecture
• Extremal Combinatorics
• Lower bounds for constant weight codes

This page was built for publication: On the number of bases of almost all matroids