Library / Belarusian Mathematical Olympiad /113 of 208

Belarusian Mathematical Olympiad

Combinatorics Difficulty 6.1 National Olympiad Prove it Belarus

There are $n \ge 5$ cities in some country. Some of the cities are connected with each other by roads, and the next three conditions are satisfied:
1) there is at most one road between any two cities;
2) not all cities are connected with each other;
3) there are exactly $k \ge 1$ roads between any four cities.
Find all $n$ and $k$ at which this situation is possible.

Solution

Answer: $n = 5, k = 3$ .

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.