Non-interval greedoids and the transposition property
type: Item
instance of: scholarly article
title: Non-interval greedoids and the transposition property
zbMATH Open document ID: 0598.05020
DOI: 10.1016/0012-365X(86)90176-7
author: Bernhard Korte
author: László Lovász
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: The authors study the common combinatorial structure of various recursive deletion procedures. Some of these (like shelling away endpoints of a tree, or vertices of the convex hull of a point set in \(R^ n\), or minimal elements of a poset) lead to greedoids with the interval property. However, some others, the so called non-interval greedoids, are also related to important procedures (like Gaussian elimination, blossom trees, series-parallel decomposition, ear-decomposition, retracting and dismantling). The present paper studies such greedoids and various exchange properties. One of them leads to the definition of transposition greedoids.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3963848
zbMATH Keywords: interval greedoids
zbMATH Keywords: recursive deletion procedures
zbMATH Keywords: greedoids with the interval property
zbMATH Keywords: non-interval greedoids
zbMATH Keywords: transposition greedoids
reviewed by: András Recski
MaRDI profile type: Publication
cites work: Q3783309
cites work: Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
cites work: Q3853684
cites work: Systems of distinct representatives and linear algebra
cites work: Q3328583
cites work: Q3928230
cites work: A note on selectors and greedoids
cites work: Structural properties of greedoids
cites work: Q3737440
cites work: Q3338268
cites work: Q3346344
cites work: Polymatroid greedoids
full work available at URL: 0012-365x(86)90176-7
OpenAlex ID: W1994164019
description: scientific article; zbMATH DE number 3963848