An intersection theorem for supermatroids
type: Item
instance of: scholarly article
title: An intersection theorem for supermatroids
zbMATH Open document ID: 0727.05016
DOI: 10.1016/0095-8956(90)90070-G
author: Éva Tardos
published in: Journal of Combinatorial Theory. Series B
publication date: 1990-01-01T00:00:00Z
review text: The author generalizes the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is partially ordered. The two partially ordered distributive supermatroids are defined on the same partially ordered set. The author also shows that the problem of finding the maximum common independent set of two supermatroids defined of different partially ordered sets contains the matroid matching problem as a special case.
reviewed by: András Recski
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 4200220
zbMATH Keywords: matroid intersection theorem
zbMATH Keywords: distributive supermatroids
zbMATH Keywords: greedoids
zbMATH Keywords: polymatroids
zbMATH Keywords: matroid matching problem
MaRDI profile type: Publication
cites work: Q5684698
cites work: Geometries on partially ordered sets
cites work: Structural properties of greedoids
cites work: Q3338268
cites work: Matching theory
description: scientific article; zbMATH DE number 4200220