The Roads of Mathematica

Discrete Mathematics Level 5

The beautiful country of Mathematica has \(1993\) cities , and from each one lead at least \(93\) roads. Each road links two cities. It is known that you can reach any city from any other city by traveling along these roads.

Over all possible layouts that satisfy the above condition, what is the minimum number of transfers one must make to guarantee to reach any city from any city?

Details and Assumptions:
No two roads connect the same two cities.


Problem Loading...

Note Loading...

Set Loading...