This a a clevergraph theoryquestion.

Suppose that are the three people who are not mutually acquainted with each other(that is none of the three knows any of the other two). Suppose two other people are not mutually acquainted with each other.

Consider the set . Is it true that among that set of four there is at least one person who knows each of the other three?

How does that prove it?