Axiomatizing simple binary matroids by their closed circuits

DOI10.1016/0893-9659(93)90075-XzbMath0791.94018MaRDI QIDQ1324489

Marcel Wild

Publication date: 24 May 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

nonspanning circuits

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Base exchange properties of graphic matroids ⋮ The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Chordal characterization of graphic matroids
• A note on the non-spanning circuits of a matroid
• A theory of finite closure spaces based on implications

This page was built for publication: Axiomatizing simple binary matroids by their closed circuits