Difference between revisions of "1981 USAMO Problems/Problem 2"
(Created page with "==Problem== 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 b...") |
|||
| Line 7: | Line 7: | ||
==See Also== | ==See Also== | ||
{{USAMO box|year=1981|num-b=1|num-a=3}} | {{USAMO box|year=1981|num-b=1|num-a=3}} | ||
| + | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 18:11, 3 July 2013
Problem
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, 
are such that the links between 
and 
are all air, all bus or all train.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1981 USAMO (Problems • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
