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 to bus stop , then we shall say can be reached from . We shall use the phrase comes after when we wish to express that every bus stop from which the bus stop can be reached is a bus stop from which the bus stop can be reached, and every bus stop that can be reached from can also be reached from . A visitor to this town discovers that if and are any two different bus stops, then the two sentences “ can be reached from ” and “ comes after ” have exactly the same meaning in this town. Let and be two bus stops. Show that of the following two statements, exactly one is true:
(i) can be reached from
(ii) can be reached from