On a generalization of the matroid (Q3344218)
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 3877209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a generalization of the matroid |
scientific article; zbMATH DE number 3877209 |
Statements
1984
0 references
exchange condition
0 references
semimatroids
0 references
On a generalization of the matroid (English)
0 references
0.826213002204895
0 references
0.745493471622467
0 references
0.7281808853149414
0 references
0.7211608290672302
0 references
A semimatroid is a pair \(H=<X,{\mathcal B}>\) where X is a non-empty finite set and \({\mathcal B}\) is a non-empty collection of pairwise incomparable subsets of X. The members of \({\mathcal B}\) are called the bases of H. This paper considers the class of \(e^*\)-semimatroids, a class of semimatroids in which the bases satisfy a certain exchange condition involving pairs of elements. The authors note that all matroids are \(e^*\)-semimatroids and prove that the bases of an \(e^*\)-semimatroid are equicardinal. They also answer a question of \textit{L. Szamkołowicz} [Recent Adv. Graph Theory, Proc. Symp. Prague 1974, 501-505 (1975; Zbl 0326.05120)] concerning a class of \(e^*\)-semimatroids that arise from graphs.
0 references