IL-GILLIS 1997 Problem 6
In a certain country, every two cities are connected either by an airline route or by a railroad. Prove that one can always choose a type of transportation in such a way that each city can be reached from any other city with at most two transfers.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.