A matching on a bipartite graph G=(A∪B,E)G=(A∪B,E) is:
A subset M⊆E such that no two edges in Mare incident with acommon vertex.
A subset M⊆E such that every edge in M goes between two verticesof A or two vertices of B
A subset M⊆Esuch that no two vertices in M are incident with acommon edge.
A subset M⊆E such that no two edges in M are incident with acommon vertex and every vertex in A is incident with at least oneedge is M
Expert Answer
An answer will be send to you shortly. . . . .