Subcontests
(4)Girls and boys dancing from town X and Y
Let n≥1 be an integer. In town X there are n girls and n boys, and each girl knows each boy. In town Y there are n girls, g1,g2,…,gn, and 2n−1 boys, b1,b2,…,b2n−1. For i=1,2,…,n, girl gi knows boys b1,b2,…,b2i−1 and no other boys. Let r be an integer with 1≤r≤n. In each of the towns a party will be held where r girls from that town and r boys from the same town are supposed to dance with each other in r dancing pairs. However, every girl only wants to dance with a boy she knows. Denote by X(r) the number of ways in which we can choose r dancing pairs from town X, and by Y(r) the number of ways in which we can choose r dancing pairs from town Y. Prove that X(r)=Y(r) for r=1,2,…,n.