MathDB
Towns

Source:

September 5, 2010
combinatorics proposedcombinatorics

Problem Statement

A town has a road network that consists entirely of one-way streets that are used for bus routes. Along these routes, bus stops have been set up. If the one-way signs permit travel from bus stop XX to bus stop YXY \neq X, then we shall say YY can be reached from XX. We shall use the phrase YY comes after XX when we wish to express that every bus stop from which the bus stop XX can be reached is a bus stop from which the bus stop YY can be reached, and every bus stop that can be reached from YY can also be reached from XX. A visitor to this town discovers that if XX and YY are any two different bus stops, then the two sentences “YY can be reached from XX” and “YY comes after XX” have exactly the same meaning in this town. Let AA and BB be two bus stops. Show that of the following two statements, exactly one is true: (i) BB can be reached from A;A; (ii) AA can be reached from B.B.