Enumerating matroids and linear spaces

DOI10.5802/crmath.423OpenAlexW4318773876MaRDI QIDQ2683212

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

Publication date: 3 February 2023

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

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

zbMATH Keywords

Steiner systemsmatroidsasymptotic enumerationtriple systemspaving matroid

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) Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of matroids
• Points and lines. Characterizing the classical geometries
• The asymptotic number of geometries
• Counting designs
• On the number of matroids on a finite set
• Asymptotic enumeration by degree sequence of graphs of high degree
• An upper bound for the number of matroids
• An upper bound on the number of Steiner triple systems
• Coloured and Directed Designs
• Almost all Steiner triple systems have perfect matchings
• On the Number of Combinatorial Geometries
• The number of partial Steiner systems and d-partitions