Overview

complete matching


Related Overviews

 

'complete matching' can also refer to...

 

More Like This

Show all results sharing this subject:

  • Mathematics

GO

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.