Maths Olympiad Prep

Library / /2 of 4

Combinatorics Difficulty 4.8 AIME Prove it Brazil

At a party every woman dances with at least one man, and no man dances with every woman. Show that there are men MM and MM' and women WW and WW' such that MM dances with WW, MM' dances with WW', but MM does not dance with WW', and MM' does not dance with WW.

Solution

Let MM be one of the men who dance with the maximal number of women, WW' one of the women he doesn't dance with, and MM' one of the men WW' dances with. If MM' were to dance with every woman that MM dances with, then the maximality of the number of women that MM dances with would be contradicted, so there is a woman WW that dances with MM but not with MM', and we're done.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.