In Onewayland, between every pair of cities there is a one-way highway in some direction. (A one-way highway is a road where traffic only flows in one direction.) To keep traffic moving quickly these highways only intersect within cities.

Prove by induction, that as long as there are at least 2 cities in Onewayland, there exists a travel path along the one-way highways that includes every city exactly once.