Problem #PRU-78653

Graph Theory Problems Calculus Real numbers Integer and fractional parts. Archimedean property

Problem

Airlines connect pairs of cities. How can you connect 50 cities with the fewest number of airlines so that from every city you can get to any other city by taking at most two flights?