Doubly Exponentially Many Ingleton Matroids

DOI10.1137/17M1160094zbMath1388.05029arXiv1710.01924OpenAlexW2964120358MaRDI QIDQ4563372

No author found.

Publication date: 1 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

enumerationmatroidrepresentable

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

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 ⋮ Common information, matroid representation, and secret sharing for matroid ports

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of matroids
• On excluded minors for real-representability
• On the asymptotic proportion of connected matroids
• Matroids with nine elements
• Counting independent sets in triangle-free graphs
• Lower bounds for constant weight codes

This page was built for publication: Doubly Exponentially Many Ingleton Matroids