Assertion: graph's matching | /r/CapableOf | use many edges
Facets:
Source sentences:
text: Polynomial time algorithms are known for many algorithmic problems on matchings, including maximum matching (finding a matching that uses as many edges as possible), maximum weight matching, and stable marriage.