Blocking, antiblocking, and pairs of matroids and polymatroids

DOI10.1016/0095-8956(78)90008-4zbMath0401.05032OpenAlexW2031870383MaRDI QIDQ1255012

Colin J. H. McDiarmid

Publication date: 1978

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(78)90008-4

zbMATH Keywords

AntiblockingBlockingMatroid OperationsPairs of MatroidsPolymatroids

Mathematics Subject Classification ID

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

Related Items (10)

Minimum \(k\) arborescences with bandwidth constraints ⋮ On box totally dual integral polyhedra ⋮ Generalized polymatroids and submodular flows ⋮ On matroid intersections ⋮ Transversal matroid intersections and related packings ⋮ Dominants and submissives of matching polyhedra ⋮ Integral decomposition in polyhedra ⋮ On the use of penumbras in blocking and antiblocking theory ⋮ Integer Rounding for Polymatroid and Branching Optimization Problems ⋮ Testing membership in matroid polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• An unbounded matroid intersection polyhedron
• Anti-blocking polyhedra
• Rado's theorem for polymatroids
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: Blocking, antiblocking, and pairs of matroids and polymatroids