Given two sets A and B of sizes |A| = n and |B| = m, where m >= n.
There are edges from set A to set B.
I need to find the
number of matchings where all of vertices in set A have been matched with one vertex in set B.
Is it possible to caclulate this quantity ?
(I have very little knowledge of Graph Thory and Bipartite Matching or how it is computed)