Problem

Source: 2008 Bulgarian Autumn Math Competition, Problem 10.4

Tags: combinatorics, graph theory



There are $3\leq n\leq 25$ passengers in a bus some of which are friends. Every passenger has exactly $k$ friends among the passengers, no two friends have a common friend and every two people, who are not friends have a common friend. Find $n$.