KURSCHAK 2014 Problem 1

Consider a company of $n\ge 4$ people, where everyone knows at least one other person, but everyone knows at most $n-2$ of the others. Prove that we can sit four of these people at a round table such that all four of them know exactly one of their two neighbors. (Knowledge is mutual.)