complete matching

complete matching

[kəm¦plēt ′mach·iŋ] (mathematics) A subset of the edges of a bipartite graph that consists of edges joining each of the vertices in one of the sets of vertices defining the bipartite structure with distinct vertices in the other such set.