MathNet 2000 — Math Olympiad Vault Question 86

Let $G$ be a connected simple graph which has $2p$ vertices (where $p$ is a positive integer), but contains no triangles. Prove that the number $\#E$ of its edges satisfies $\#E \leq p^2$.