Problem

Source: Turkey National Olympiad 2002 - D1 - P3

Tags: combinatorics unsolved, combinatorics



Graph Airlines $ (GA)$ operates flights between some of the cities of the Republic of Graphia. There are at least three $ GA$ flights from each city, and it is possible to travel from any city in Graphia to any city in Graphia using $ GA$ flights. $ GA$ decides to discontinue some of its flights. Show that this can be done in such a way that it is still possible to travel between any two cities using $ GA$ flights, yet at least $ 2/9$ of the cities have only one flight.