MathDB

In a country, some cities are connected by two-way airlines, and one can get from any city to any other city in no more than

n{}

flights. Prove that all airlines can be distributed among

n{}

companies so that a route can be built between any two cities in which no more than two flights of each company would meet.
From the folklore

Problem Statement