Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Girls and Boys in the same school, each girl know 10 boys and each boy knows 10 girls, prove that the number of boys and the number of girls in the school is the same (know is symmetric = if girl G is know the boy B, then B is know G)

I think this question is related with Pigeonhole problem, so I was trying to use Math Induction to prove it. But it is more likely about graph theory, can anyone help me about this?

share|cite|improve this question
up vote 2 down vote accepted

Draw a bipartite graph, with boys on one side and girls on the other. Draw edge between a girl and a boy if and only if they know eachother. Then each vertex has degree 10.

Question: How many edges are there? Hint Count them from the "boy" vertices, then again from the "girls" vertices...

share|cite|improve this answer
so it should be a direct graph? – JavaLeave Jul 8 '13 at 3:34
@leaveJava Not necessarily, bi-partite is enough. But making it a di-graph might work better, then you can easely count the total in-degree and the total out-degree. – N. S. Jul 8 '13 at 3:38

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.