Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2000 — Math Olympiad Vault Question 42

Math Olympiad Vault · MathNet 2000 — Math Olympiad Vault

Question 42

Fredek runs a private hotel. He claims that whenever $n \geqslant 3$ guests visit the hotel, it is possible to select two guests who have equally many acquaintances among the other guests, and who also have a common acquaintance or a common unknown among the guests. For which values of $n$ is Fredek right?

(Acquaintance is a symmetric relation.)