MathDB
town connection limit

Source: Russia 1993, problem 11.8

June 17, 2008
ceiling functioninequalitiescombinatorics unsolvedcombinatorics

Problem Statement

There are 1993 1993 towns in a country, and at least 93 93 roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than 62 62 transfers.