Abstract
Let M 1 = (S, F 1), M 2 = (S, F 2),..., M k = (S, F k ) be k matroids on the same underlying set S. We define the sum (or union) of these matroids to be the matroid on the same set S with X ⊆ S independent if and only if X can be decomposed as X 1 ∪ X 2 ∪ ... ∪ X k where X 1 ∈ F 1, X 2 ∈ F 2,..., X k ∈ F k .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Recski, A. (1989). The sum of matroids I. In: Matroid Theory and its Applications in Electric Network Theory and in Statics. Algorithms and Combinatorics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22143-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-22143-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-22145-7
Online ISBN: 978-3-662-22143-3
eBook Packages: Springer Book Archive