Complete graph

The complete graph on $S$ is the undirected graph $(S, \{(s,s') \vert \ s, s' \in S \mbox{ with } s \not = s'\})$. (i.e. it is the graph with vertices $S$ and every possible edge between them excluding self-connected edges.)