No label defined (Q3724360)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3954942
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3954942

      Statements

      0 references
      1985
      0 references
      greedoid
      0 references
      rank function
      0 references
      cycle
      0 references
      cocycle
      0 references
      greedoids
      0 references
      component greedoid
      0 references
      graph
      0 references
      [For the entire collection see Zbl 0587.00006.] There are considered greedoids (E,\({\mathcal F})\) with a rank r such that every set \(X\subseteq E\) where \(0<| X| \leq r\) has the accessibility property. Three examples are given: the component greedoid of a undirected graph, the strongly component greedoid and the cocycle greedoid of a directed graph. Some structural properties of such greedoids are discussed.
      0 references

      Identifiers