Matching as the Intersection of Matroids
✍ Scribed by Sándor P. Fekete; Robert T. Firla; Bianca Spille
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 203 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We discuss a composition operation of delta-matroids, called delta-sum, in relation to similar compositions of related combinatorial structures like matroids and jump systems. The delta-sum of matching delta-matroids is associated with the linkings of a graph. We exhibit a min-max formula for the po
A principal transversal matroid is one containing a basis which spans all cyclic flats. A matroid M is the basis intersection of matroids M1,.. •, Mk if the bases of M are precisely the common bases of M1,..., Mk. Bondy and Welsh [2], Brualdi [3] and Bixby [1] have shown that every matroid is the ba
Wz give a new proof of a theorem of Bondy and Welsh. Our proof is simpler than previous ones in that it makes no use of Hall's theorem on tht: existence of a transversal of a family of sets.