Question:
Show that if an n-vertex graph G contains at least [n²/4]+1
Last updated: 7/24/2022
![Show that if an n-vertex graph G contains at least [n²/4]+1](https://media.kunduz.com/media/sug-question/raw/83204220-1658657068.8656337.jpeg?h=512)
Show that if an n-vertex graph G contains at least [n²/4]+1 edges, then G contains at least [n/2] triangles.
Last updated: 7/24/2022
Show that if an n-vertex graph G contains at least [n²/4]+1 edges, then G contains at least [n/2] triangles.