The sum of matroids I

  • András Recski
Part of the Algorithms and Combinatorics book series (AC, volume 6)


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 XS independent if and only if X can be decomposed as X 1X 2 ∪ ... ∪ X k where X 1F 1, X 2F 2,..., X k F k .


Rank Function Span Forest Matroid Partition Matroid Intersection Problem Electric Network Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • András Recski
    • 1
  1. 1.Eötvös Loránd UniversityBudapest VIIIHungary

Personalised recommendations