number of triangles in a graph

👨🏻‍🏫 學術台數學

2009-07-06 7:42 am

Prove that if the graph G has 2n vertices and more than n^2 edges, then G contains at least n triangles

回答 (1)

2009-07-13 11:41 pm

✔ 最佳答案

The solution is:

圖片參考：http://i187.photobucket.com/albums/x22/cshung/7009070502009.png

2009-07-13 15:43:22 補充：
Solution available at:

http://i187.photobucket.com/albums/x22/cshung/7009070502009.png

2009-07-13 16:37:56 補充：
奇怪，現在不能貼圖了？
http://i187.photobucket.com/albums/x22/cshung/7009070502009.png

參考: 從不抄襲。, 從不抄襲。, 從不抄襲。

👍 0 👎 0

收錄日期: 2021-04-22 00:52:42
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20090705000051KK02009

檢視 Wayback Machine 備份