MathDB
n persons a a party, everyone dislikes only 1

Source: 2023 Czech-Polish-Slovak Match Junior, Team p3 CPSJ

May 5, 2024
combinatorics

Problem Statement

nn people met at the party, with n2n \ge 2. Each person dislikes exactly one other person present at the party (but not necessarily reciprocal, i.e. it may happen that AA dislikes BB even though BB does not dislike AA) and likes all others. Prove that guests can be seated at three tables in such a way that each guest likes all the people at his table.