Is it possible to match two women to each man so that every women will not match more than once

Question

I am new to this topic and I have no idea how to proceed. Any help ?

Given a group of men and group of women. Every group of man $A$, $|A|$=$x$ knows a group of women $B$ and the cardinality of $B$ is at least $2x$.
Prove that it is possible to match two women to each man so that every women will not match more than once.

Thank you

Answer 1

Hint:

• Clone each man so that you will have the same number of man and woman.
• Use Hall's marriage theorem.