Abstract
Matroids were introduced in the early 1930’s in an attempt to axiomatize and generalize basic notions in linear algebra such as dependence, basis and span. The importance of matroids came to be appreciated with the discovery of new classes of matroids so that today we may rightly consider them as a unifying concept for a large part of combinatorics opening up basic combinatorial questions to algebraic ideas and methods. One of these fields is graph theory; in fact, it was precisely this correspondence between concepts in linear algebra and concepts in graph theory which set the theory of matroids on its way. Since then, other branches of combinatorics such as transversal theory, incidence structures and combinatorial lattice theory have been brought successfully into the realm of matroid theory. Indeed, it is this exchange of ideas from various fields which is one of the most gratifying aspects of matroid theory and also one measure of its success.
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
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M. (1997). Matroids: Introduction. In: Combinatorial Theory. Classics in Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59101-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-59101-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61787-7
Online ISBN: 978-3-642-59101-3
eBook Packages: Springer Book Archive