The intersection of matroids and antimatroids

Bernhard Korte, L. Lovász

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Antimatroids are combinatorial structures abstracting some properties of convexity, and in a sense dual to matroids. Greedoids are common generalizations of matroids and antimatroids. We introduce a general operation to produce a greedoid from a matroid and an antimatroid on the same ground set. Greedoids arising by this operation are called trimmed matroids. Many known classes of greedoids are shown to be trimmed matroids. We derive two submodularity properties of trimmed matroids and a subclass of them called polymatroid greedoids. These are used to verify the properties of a rather elaborate counterexample, which shows that certain local properties do not characterize trimmed matroids and polymatroids greedoids (as was conjectured in an earlier paper).

Original languageEnglish
Pages (from-to)143-157
Number of pages15
JournalDiscrete Mathematics
Volume73
Issue number1-2
DOIs
Publication statusPublished - 1988

Fingerprint

Antimatroid
Matroid
Intersection
Polymatroid
Submodularity
Local Properties
Counterexample
Convexity
Verify

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

The intersection of matroids and antimatroids. / Korte, Bernhard; Lovász, L.

In: Discrete Mathematics, Vol. 73, No. 1-2, 1988, p. 143-157.

Research output: Contribution to journalArticle

Korte, Bernhard ; Lovász, L. / The intersection of matroids and antimatroids. In: Discrete Mathematics. 1988 ; Vol. 73, No. 1-2. pp. 143-157.
@article{7c2991f6fbc14f3d8ab7eb08ed8eaaf6,
title = "The intersection of matroids and antimatroids",
abstract = "Antimatroids are combinatorial structures abstracting some properties of convexity, and in a sense dual to matroids. Greedoids are common generalizations of matroids and antimatroids. We introduce a general operation to produce a greedoid from a matroid and an antimatroid on the same ground set. Greedoids arising by this operation are called trimmed matroids. Many known classes of greedoids are shown to be trimmed matroids. We derive two submodularity properties of trimmed matroids and a subclass of them called polymatroid greedoids. These are used to verify the properties of a rather elaborate counterexample, which shows that certain local properties do not characterize trimmed matroids and polymatroids greedoids (as was conjectured in an earlier paper).",
author = "Bernhard Korte and L. Lov{\'a}sz",
year = "1988",
doi = "10.1016/0012-365X(88)90142-2",
language = "English",
volume = "73",
pages = "143--157",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - The intersection of matroids and antimatroids

AU - Korte, Bernhard

AU - Lovász, L.

PY - 1988

Y1 - 1988

N2 - Antimatroids are combinatorial structures abstracting some properties of convexity, and in a sense dual to matroids. Greedoids are common generalizations of matroids and antimatroids. We introduce a general operation to produce a greedoid from a matroid and an antimatroid on the same ground set. Greedoids arising by this operation are called trimmed matroids. Many known classes of greedoids are shown to be trimmed matroids. We derive two submodularity properties of trimmed matroids and a subclass of them called polymatroid greedoids. These are used to verify the properties of a rather elaborate counterexample, which shows that certain local properties do not characterize trimmed matroids and polymatroids greedoids (as was conjectured in an earlier paper).

AB - Antimatroids are combinatorial structures abstracting some properties of convexity, and in a sense dual to matroids. Greedoids are common generalizations of matroids and antimatroids. We introduce a general operation to produce a greedoid from a matroid and an antimatroid on the same ground set. Greedoids arising by this operation are called trimmed matroids. Many known classes of greedoids are shown to be trimmed matroids. We derive two submodularity properties of trimmed matroids and a subclass of them called polymatroid greedoids. These are used to verify the properties of a rather elaborate counterexample, which shows that certain local properties do not characterize trimmed matroids and polymatroids greedoids (as was conjectured in an earlier paper).

UR - http://www.scopus.com/inward/record.url?scp=38249031911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249031911&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(88)90142-2

DO - 10.1016/0012-365X(88)90142-2

M3 - Article

AN - SCOPUS:38249031911

VL - 73

SP - 143

EP - 157

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-2

ER -