On a covering problem of Mullin and Stanton for binary matroids

DOI10.1007/BF02190499zbMath0433.05020OpenAlexW4245210206MaRDI QIDQ1139053

James G. Oxley

Publication date: 1980

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/182384

zbMATH Keywords

(m,k) coverminimal (m,k)-matroidminimal m-blocks

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

On Connectivity in Matroids and Graphs ⋮ Critical problem for a \(q\)-analogue of polymatroids ⋮ Minimal blocks of binary even-weight vectors ⋮ On a matroid identity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strengthened form of Tutte's characterization of regular matroids
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• On the algebraic theory of graph colorings
• A Combinatorial Model for Series-Parallel Networks
• A Decomposition for Combinatorial Geometries
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

This page was built for publication: On a covering problem of Mullin and Stanton for binary matroids