The edge covering number of the intersection of two matroids

DOI10.1016/j.disc.2011.03.036zbMath1238.05206OpenAlexW2088077407MaRDI QIDQ658021

Eli Berger, Ron Aharoni, Ran Ziv

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.036

zbMATH Keywords

hypergraphspolymatroidsedge covermatroid theorymatroid intersectionmatching theorySeymour-Goldberg conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

On a Generalization of the Ryser-Brualdi-Stein Conjecture ⋮ Fair representation in the intersection of two matroids ⋮ Choice functions ⋮ On the complexity of packing rainbow spanning trees ⋮ Partitioning into common independent sets via relaxing strongly base orderability

Cites Work

• Some properties of basic families of subsets
• The intersection of a matroid and a simplicial complex
• A Multiple Exchange Property for Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The edge covering number of the intersection of two matroids