Complete Graph

A simple graph where every pair of vertices is adjacent. Denoted by $K_n$ where $n$ is the number of vertices.

Contains the maximum number of edges for a simple graph.