# Interesting question on Graph Theory [closed]

In a village there are an equal number of boys and girls of marriageable age. Each boy dates a certain number of girls and each girl dates a certain number of boys. Under what condition is it possible that every boy and girl gets married to one of their dates?(Polygamy and polyandry not allowed)

-

## closed as off-topic by avid19, Davide Giraudo, Live Forever, graydad, RecklessReckonerNov 18 '15 at 3:24

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – avid19, Davide Giraudo, Live Forever, graydad, RecklessReckoner
If this question can be reworded to fit the rules in the help center, please edit the question.

Is there a particular reason why you did not accept any of the answers you got on this site? Do you feel that all of them do not answer you question or you just don't know how to accept an answer? More on accepting answers: meta.math.stackexchange.com/questions/3286/… – Dennis Gulko Mar 13 '13 at 9:05

What you actually have is a bipartite graph and you are looking for a perfect matching. The theorem that provides a characterization for such conditions is Hall's marriage theorem: There exists a perfect matching for the graph if and only if for any set of boys $B$, $|B|\leq|N(B)|$ where $N(B)$ denotes the set of girls that date at least one of the boys from $B$.