Problem #WSP-000147

Problems Graph theory

Problem

There are \(6\) people at a party. Each two people either know each other or not, and the knowledge goes both ways: if \(A\) knows \(B\), then \(B\) knows \(A\). Show that there either is a trio of people who all know each other or a trio of people who all don’t know each other.