17 views
Let $m$ be a fixed integer greater than $2.$ Prove that all simple graphs having $n\;(n \geq 3)$ vertices and with $m$ edges are connected if and only if $m>\left(\begin{array}{c}n-1 \\ 2\end{array}\right)$.

1
37 views