# Thread: Calculate number of edges

1. ## Calculate number of edges

Let n>= 3 be an integer. Calculate the number of edges in Kn

2. $K_n$ is the complete graph of order $n$. There is an edge between any two vertices.
So ${n} \choose {2}$.

3. ## Calculate number of edges

So, n(n-1)/2 =3

4. Originally Posted by maptorren
So, n(n-1)/2 =3
If n=3, then yes.
If n=10, then $|E|=45$.