USAMO 1981 Problem 2

What is the largest number of towns that can meet the following criteria. Each pair is directly linked by just one of air, bus or train. At least one pair is linked by air, at least one pair by bus and at least one pair by train. No town has an air link, a bus link and a trian link. No three towns, A, B, C are such that the links between $\mathrm{AB}, \mathrm{AC}$ and $\mathrm{BC}$ are all air, all bus or all train.