Abstract
Basically there have been two attempts to generalize classical matroids to ordered sets. The first one is the notion of supermatroids introduced by Dunstan, Ingleton and Welsh [1972]. Here the independent sets correspond to nodes in a partially ordered set so that if x is independent, then the whole principal ideal of x consists of independent nodes and for any y, any two maximal independent nodes below y have the same height.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Greedoids on Partially Ordered Sets. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive