- #1
Oster
- 85
- 0
1. Prove that a graph with n vertices that has no triangles has at most (n^2)/4 edges.
2.
3. Um so i was thinking maybe you start off with a complete graph and then keep deleting edges so as to remove the triangles within it or something? Or maybe by induction?
2.
3. Um so i was thinking maybe you start off with a complete graph and then keep deleting edges so as to remove the triangles within it or something? Or maybe by induction?