Question 93
In a group of $B$ boys and $G$ girls it is known that $G \geq 2 B-1$. Some boys know some girls. Prove that it possible to arrange a dance in pairs in such a way that all boys will dance and every boy who does not know the girl in his pair knows only girls who do not dance.