Abstract
Matroids were introduced by Whitney [1935] as a combined abstraction of linear independence and the cycle structure of graphs. However, they were already considered by Borůvka [1926] from a different point of view and characterized by a basic algorithmic property. Later, but independently, they were also rediscovered by van der Waerden [1937] as a combination of linear and algebraic independence. Modern matroid theory started with the fundamental work of Tutte [1959].
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
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Korte, B., Schrader, R., Lovász, L. (1991). Abstract Linear Dependence — Matroids. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive