Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T17:50:16.768Z Has data issue: false hasContentIssue false

Large Matchings in Graphs

Published online by Cambridge University Press:  20 November 2018

J. Weinstein*
Affiliation:
St. Mary's College of Maryland, St. Mary's City, Maryland
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974