Packing and covering with matroid circuits

DOI10.1016/0095-8956(80)90067-2MaRDI QIDQ1146680zbMATH OpenOpenAlexFDO

Authors Paul Seymour

Publication date 1980

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(80)90067-2

zbMATH Keywords

rankcircuitconnected componentcorankconnected matroid

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Cocircuit coverings and packings for binary matroids
• Connectivity in Matroids
• Matroid representation over GF(3)

Cited in

(7)

• On Connectivity in Matroids and Graphs
• How many circuits determine an oriented matroid?
• Matroid packing and covering with circuits through an element
• On minor-minimally-connected matroids
• On a matroid generalization of graph connectivity
• A minimal 3-connectedness result for matroids
• Minimum \(T\)-joins and signed-circuit covering

This page was built for publication: Packing and covering with matroid circuits

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