一个研究生班里有
17人,其中每个人都有4个朋友,证明存在两个互相不是朋友的人也没有共同的朋友。Let’s prove by contradiction.
Suppose the argument is not true, then for any two students, either they are friends or they have a common friend. Consider any person, say A. He/she has exactly 4 friends. Let’s call them B1, B2, B3, and B4.
Now, the remaining 17 – (4 + 1) = 12 students can’t be A’s friend directly, so they have to know A through Bi’s.
Since each Bi can have three friends besides A, we are sure that
|
Use pigeonhole principle. Represent each person as a point; if two points have friendship, connect them with red line, otherwise blue line. 1) There are totally 17*4/2=34 red lines. 2) There are totally (17 choose 3)=680 distinct triangles possibly formed by 17 points. Each triangle side is at most shared by 15 triangles. Since 34*15 < 680, there are triangles with all blue sides. QED. |
we have to prove that there exists a blue edge AB provided that there is no point C such that both AC and BC are red. It seems to me that you have proved that there are many blue triangles, you still need disprove that all blue edges are also shared by other triangles with two red edges. Am I right? |
欢迎光临 珍珠湾ART (http://zzwav.com/) | Powered by Discuz! X3 |