##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(No shared endpoints)
A matching in a bipartite graph is a set of edges where no two edges share a vertex. Think of it like pairing dancers: each person can dance with at most one partner. If you have graph where and are the two groups, a matching means every vertex appears in at most one edge of .
No vertex can be matched twice. This is the foundation of all bipartite matching problems.
