ILL 1984 Problem 34
One country has cities and every two of them are linked by a railroad. A railway worker should travel by train exactly once through the entire railroad system (reaching each city exactly once). If it is impossible for worker to travel by train between two cities, he can travel by plane. What is the minimal number of flights that the worker will have to use?
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.