Show Summary Details

Quick Reference

In a bipartite graph a matching is a subset of the edges in the graph for which no two edges share a common vertex. A maximal matching is a matching in which the number of edges is as large as possible.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.