Large Matchings in Graphs
- 1 December 1974
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 26 (6) , 1498-1508
- https://doi.org/10.4153/cjm-1974-145-8
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- On Independent Complete Subgraphs in a GraphCanadian Journal of Mathematics, 1968
- On the Number of Disjoint Edges in a GraphCanadian Journal of Mathematics, 1963