Two-way flights are operated between 80 cities in such a way that each city is connected to at least 7 other cities by a direct flight and any two cities are connected by a finite sequence of flights. Find the smallest k such that for any such arrangement of flights it is possible to travel from any city to any other city by a sequence of at most k flights. combinatorics proposedcombinatorics