Today, I found a paper plane in the hallway. It has mathematics on it. Fly, maths, fly!
Every non-connected graph with n vertices has at most 1/2 * (n-1) * (n-2) edges.
