Abstract
The spaces of a system were studied in Chapter II in Chapter III they were interpreted in the context of multigraphs and in Chapter IV in the context of networks. Once again we shall see how a single combinatorial notion transcends the peculiarities of the model which serves as the vehicle for its presentation. The Main Matching Theorem, to be presented and proved in the first section of this chapter, is the keystone for the rest of the chapter. Initially the vehicle for presentation is the bipartite graph. In the subsequent sections, the Main Matching Theorem will give information about many outwardly dissimilar yet nearly equivalent structures.
This is a preview of subscription content, log in via an institution to check access.
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
© 1977 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Graver, J.E., Watkins, M.E. (1977). Matchings and Related Structures. In: Combinatorics with Emphasis on the Theory of Graphs. Graduate Texts in Mathematics, vol 54. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-9914-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-9914-1_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9916-5
Online ISBN: 978-1-4612-9914-1
eBook Packages: Springer Book Archive