On binary paving matroids

DOI10.1016/0012-365X(88)90085-4MaRDI QIDQ1108281zbMATH OpenFDO

Authors D. Acketa

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90085-4

zbMATH Keywords

binary paving matroidscharacterization

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(11)

• Ternary paving matroids
• On binary \(k\)-paving matroids and Reed-Muller codes
• On paving matroids and a generalization of MDS codes
• Hypergraph characterization of split matroids
• Determining a binary matroid from its small circuits
• scientific article; zbMATH DE number 1003264 (Why is no real title available?)
• On the structure of the \(h\)-vector of a paving matroid
• Rota’s Basis Conjecture for Paving Matroids
• A note on connectivity preserving splitting operation for matroids representable over GF(p)
• k-loose elements and k-paving matroids
• A generalisation of uniform matroids

This page was built for publication: On binary paving matroids

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