Characterizing matchings as the intersection of matroids
✍ Scribed by Sándor P. Fekete; Robert T. Firla; Bianca Spille
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 359 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0340-9422
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 matroid or oriented matroid is dyadic if it has a rational representation with all nonzero subdeterminants in [ \2 k : k # Z]. Our main theorem is that an oriented matroid is dyadic if and only if the underlying matroid is ternary. A consequence of our theorem is the recent result of G. Whittle th