On binary paving matroids

DOI10.1016/0012-365X(88)90085-4zbMATH Open0654.05020MaRDI QIDQ1108281FDOQ1108281

Authors: D. Acketa 

Publication date: 1988

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

zbMATH Keywords

characterizationbinary paving matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)

Cited In (10)

• A generalisation of uniform matroids
• Hypergraph characterization of split matroids
• On the structure of the \(h\)-vector of a paving matroid
• On binary \(k\)-paving matroids and Reed-Muller codes
• Title not available (Why is that?)
• Rota’s Basis Conjecture for Paving Matroids
• A note on connectivity preserving splitting operation for matroids representable over \(GF(p)\)
• Ternary paving matroids
• Determining a binary matroid from its small circuits
• On paving matroids and a generalization of MDS codes

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)