Search found 1 match
Search found 1 match • Page 1 of 1
- Sat Nov 12, 2005 10:39 am
- Forum: Volume 109 (10900-10999)
- Topic: 10973 - Triangle Counting
- Replies: 31
- Views: 14179
Your assumption that the number of edges in such a graph is less than 3*V is wrong. Consider a complete bi-partite graph of V vertices with V/2 vertices on each part. This graph does not have any triangles and has V^2/4 edges.