Bipartite graph with maximum matching
Home
>
Mathematics
>
Graph theory
>
Bipartite Graphs
>
Bipartite graph with maximum matching
A graph that has the maximum possible number of edges that do not have a common vertex.