Given two sets $A$ and $B$, determine whether there is a mapping of members of $A$ to $B$ so that each member of $B$ has been mapped by at most $k$ members of $A$.
Does any one know what this problem is called?
user3070752
- 139
- 2