Abstract
Intersections of matroids and antimatroids have come up earlier in various ways, for example as polymatroid greedoids or ordered geometries. It is natural to try to find such a representation for other classes of greedoids. The intersection of a matroid and an antimatroid is not always a greedoid; but there is a slightly different way of combining a matroid with an antimatroid, which always results in a greedoid. We call this construction the “meet”, which will be the main topic of this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Korte, B., Schrader, R., Lovász, L. (1991). Intersection, Slimming and Trimming. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive