An ``antimatroid is a finite set together with a closure operator which satisfies the ``anti-exchange property. (Closure operators of matroids satisfy the ``exchange property. The definition used in this paper is based on the set of complements of closed sets of the antimatroid.) Let \(\mathcal A\) be an antimatroid on \(E\), \(p \in E\), and \(\mathcal B\) the antimatroid on \(E \setminus \{p\}\) obtained by ``reduction (sometimes called ``deletion) of \(p\). The operation of retrieving \(\mathcal A\) by using the structure of \(\mathcal B\) and certain additional information is termed a ``lifting. The paper distinguishes two types of liftings and shows that this dichotomy can be used to characterize the edge-shelling antimatroids of trees and the poset-shelling antimatroids.
- Single element extensions of matroids of arbitrary cardinality
- scientific article; zbMATH DE number 7201
- The Hadamard matroid and an anomaly in its single element extensions
- An algorithmic characterization of antimatroids
- Antimatroids induced by matchings
- Anti-matroids
- scientific article; zbMATH DE number 3849248
- On singleton 1-rounded sets of matroids
- A matroid extension result
- Two Characterizations of Antimatroids
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- Whitney numbers of matroid extensions and co-extensions
- Lifting and reduction of antimatroids
- scientific article; zbMATH DE number 7201 (Why is no real title available?)
- scientific article; zbMATH DE number 1156629 (Why is no real title available?)
- On singleton 1-rounded sets of matroids
This page was built for publication: A single-element extension of antimatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613372)
