Doubly exponentially many ingleton matroids
From MaRDI portal
Abstract: A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set is doubly exponential in ; it follows that almost all Ingleton matroids are non-representable.
Recommendations
Cites work
- Counting independent sets in triangle-free graphs
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- Lower bounds for constant weight codes
- Matroids with nine elements
- On excluded minors for real-representability
- On the asymptotic proportion of connected matroids
- On the number of matroids
Cited in
(5)- On critical exponents of Dowling matroids
- Common information, matroid representation, and secret sharing for matroid ports
- Matroids on Eight Elements with the Half-Plane Property and Related Concepts
- Matroid lifts and representability
- Coordination and discoordination in linear algebra, linear information theory, and coded caching
This page was built for publication: Doubly exponentially many ingleton matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4563372)