complete matching

Show Summary Details

Quick Reference

A matching in a bipartite graph in which all vertices are used. This requires each set to have the same number of vertices, n, and the complete matching will have n edges.

Subjects: Mathematics.

Reference entries

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