Axiomatizing simple binary matroids by their closed circuits

DOI10.1016/0893-9659(93)90075-XMaRDI QIDQ1324489zbMATH OpenFDO

Authors Marcel Wild

Publication date 24 May 1994

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

Full work available at URL https://doi.org/10.1016/0893-9659(93)90075-X

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)

Recommendations

• scientific article; zbMATH DE number 1408516
• A circuit axiomatisation of Lagrangian matroids
• On the circuit-spectrum of binary matroids
• The bases and the circuits of closed regular matroids
• Determining a binary matroid from its small circuits
• Note on binary simplicial matroids
• Closure axioms for poset matroids
• On closure axioms for a matroid using Galois connections
• Simple matroids with bounded cocircuit size
• A construction for binary matroids

Cites work

• A note on the non-spanning circuits of a matroid
• A theory of finite closure spaces based on implications
• Chordal characterization of graphic matroids
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3995703 (Why is no real title available?)

Cited in

(5)

• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• A circuit axiomatisation of Lagrangian matroids
• Base exchange properties of graphic matroids
• Determining a binary matroid from its small circuits
• The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324489)