1995 USAMO Problems/Problem 5: Difference between revisions
Created page with "==Problem== Suppose that in a certain society, each pair of persons can be classified as either ''amicable'' or ''hostile''. We shall say that each member of an amicable pair ..." |
|||
| Line 6: | Line 6: | ||
==See Also== | ==See Also== | ||
{{USAMO box|year=1995|num-b= | {{USAMO box|year=1995|num-b=4|after=Last Problem}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 07:09, 19 July 2016
Problem
Suppose that in a certain society, each pair of persons can be classified as either amicable or hostile. We shall say that each member of an amicable pair is a friend of the other, and each member of a hostile pair is a foe of the other. Suppose that the society has 
persons and 
amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include 
or fewer amicable pairs.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1995 USAMO (Problems • Resources) | ||
| Preceded by Problem 4 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing
