Packing and covering with matroid circuits

DOI10.1016/0095-8956(80)90067-2zbMath0448.05022OpenAlexW1986210561MaRDI QIDQ1146680

P. D. 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)

Related Items (7)

On Connectivity in Matroids and Graphs ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ A minimal 3-connectedness result for matroids ⋮ How many circuits determine an oriented matroid? ⋮ On a matroid generalization of graph connectivity ⋮ On minor-minimally-connected matroids ⋮ Matroid packing and covering with circuits through an element

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid representation over GF(3)
• Cocircuit coverings and packings for binary matroids
• Connectivity in Matroids

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