MathDB
Doing two arrangements at the same time.

Source: ToT 2003-JA-2, SA-1

June 19, 2011
combinatorics unsolvedcombinatorics

Problem Statement

Smallville is populated by unmarried men and women, some of them are acquainted. Two city’s matchmakers are aware of all acquaintances. Once, one of matchmakers claimed: “I could arrange that every brunette man would marry a woman he was acquainted with”. The other matchmaker claimed “I could arrange that every blonde woman would marry a man she was acquainted with”. An amateur mathematician overheard their conversation and said “Then both arrangements could be done at the same time! ” Is he right?