Polymatroid greedoids

Bernhard Korte, László Lovász

Research output: Article

11 Citations (Scopus)


This paper discusses polymatroid greedoids, a superclass of them, called local poset greedoids, and their relations to other subclasses of greedoids. Polymatroid greedoids combine in a certain sense the different relaxation concepts of matroids as polymatroids and as greedoids. Some characterization results are given especially for local poset greedoids via excluded minors. General construction principles for intersection of matroids and polymatroid greedoids with shelling structures are given. Furthermore, relations among many subclasses of greedoids which are known so far, are demonstrated.

Original languageEnglish
Pages (from-to)41-72
Number of pages32
JournalJournal of Combinatorial Theory, Series B
Issue number1
Publication statusPublished - febr. 1985

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Polymatroid greedoids'. Together they form a unique fingerprint.

  • Cite this