An intersection theorem for supermatroids

DOI10.1016/0095-8956(90)90070-GzbMath0727.05016MaRDI QIDQ803140

Éva Tardos

Publication date: 1990

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

zbMATH Keywords

polymatroidsgreedoidsdistributive supermatroidsmatroid intersection theoremmatroid matching problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (7)

Toward an Automatic Approach to Greedy Algorithms ⋮ Matroids on convex geometries (cg-matroids) ⋮ Generalized matroids based on three-way decision models ⋮ Matroids on convex geometries: subclasses, operations, and optimization ⋮ Rank functions of strict cg-matroids ⋮ Poset matching---a distributive analog of independent matching ⋮ A general model for matroids and the greedy algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Structural properties of greedoids
• Matching theory
• Geometries on partially ordered sets

This page was built for publication: An intersection theorem for supermatroids