→ ab170926:K6 考慮其中一個點 有邊相連=藍色 沒邊相連=紅色 01/28 17:59
→ ab170926:用鴿籠原理就能證出來 01/28 17:59
→ x9002131:喔喔~大概了解要如何做了，謝謝! 01/28 19:21
Prove that if each the 15 edges of the complete graph K6 is colored either blue
or red, there must be at least two monochromatic triangles, where a
monochromatic triangle is a triangle whit all edges having the same color.
這題想很久想不出來
看解答也不太懂
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.138.31.175
※ 編輯: x9002131 來自: 140.138.31.187 (01/28 17:33)