At a recent party, every student knew more than half the other students (not including themselves). 2 students A and Balmost know each otherif they have a mutual friend C.

State this problem as a claim about graphsso as to study the assertion that every pair of students either knew each other or almost knew each other.

Note: "knowing" is a symmetric relation.