Article contents
Large Matchings in Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
How large a matching must a graph have?
We consider graphs G (finite, undirected, with no loops or multiple edges), with order nG (always ≧ 1) and mG the maximum number of edges in a matching of G. The matchability μG of G is the fraction (2m/n) of nodes covered by a maximum matching.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1974
References
- 6
- Cited by