Abstract
Let G = (V,E) be a graph with vertex set V and edge set E. A matching in G is a set of edges no two of them coincide with the same vertex. For a matching M we denote by |M| the number of edges in M, i.e. the cardinality of M. The set of all matchings is denoted by μ. Since by definition the empty set is a matching, μ ≠ ∅ holds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burkard, R.E., Derigs, U. (1980). The Cardinality Matching Problem. In: Assignment and Matching Problems: Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51576-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-51576-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10267-0
Online ISBN: 978-3-642-51576-7
eBook Packages: Springer Book Archive