Consider a graph $G$ where every vertex has a degree of exactly $k$. What is the relationship between the number of edges $|E|$ and the parameters $n$ and $k$?