ASU 079 All Russian MO 1966 three crossroads in a city
Source:
June 19, 2019
combinatorics
Problem Statement
For three arbitrary crossroads in a certain city there exist a way from to not coming through . Prove that for every couple of the crossroads there exist at least two non-intersecting ways connecting them. (there are at least two crossroads in the city)