An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an 'antipodal' concept of matroid. We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphi
The forbidden minor characterization of line-search antimatroids of rooted digraphs
โ Scribed by Yoshio Okamoto; Masataka Nakamura
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 303 KB
- Volume
- 131
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
โฆ Synopsis
An antimatroid is an accessible union-closed family of subsets of a รฟnite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees and shelling antimatroids of posets. In this paper, we give the forbidden minor characterization of line-search antimatroids of rooted digraphs.
๐ SIMILAR VOLUMES
An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is a 'dual' or 'antipodal' concept of matroill. We shall show that an antimatroid is derived from shelling of a poset if and only if it. docs not contain a mino