Separating people into two groups
Source:
December 31, 2011
inductiongraph theorycombinatorics unsolvedcombinatorics
Problem Statement
In a party among any four persons there are three people who are mutual acquaintances or mutual strangers. Prove that all the people can be separated into two groups and such that in everybody knows everybody else and in nobody knows anybody else.