# Graph contains triangle

Prove that if a simple graph of order n has more than n^2/4 edges then it contains a triangle.

I know Martels theorem states the opposite condition for a triangle free graph but I'm not sure how to prove this condition.

• Just to be sure, are you allowed to apply Martel's Theorem to prove what you want, or is the intent of the question to prove Martel's Theorem in the first place? – Casteels Nov 26 '14 at 17:15

Let $G$ be a simple graph of order $n$. Then Mantel's Theorem states that:
If $G$ is triangle-free, then $G$ has at most $n^2/4$ edges.
If $G$ has more than $n^2/4$ edges, then $G$ contains a triangle.
Let $G$ be a graph of order $n$ and size $m$. Assume that $G$ is $K_3$-free. Then by Mantel's Theorem we know that $m\leq {n^2\over 4}$. However, this is a contradiction since we are given that $m> {n^2\over 4}$. Thus if $G$ has order $n$ and $m>{n^2\over 4}$, then $G$ contains a triangle.