A complete subgraph, or clique, is a group of vertices in an undirected graph where every distinct pair is joined by a direct edge. One missing edge is enough to disqualify the group. section 11.1 section 11.4
A maximal clique is a complete subgraph that cannot be enlarged without losing that property. A clique need not be maximal: a smaller complete group may be part of a larger one. section 11.1
Figure 11.1 The left diagram shows every one of the five vertices connects directly to all 4 others, so all possible 10 edges are present, making it a clique. On the other side, we have a missing edge from vertex 2 to 3, which is enough to disqualify the whole group, so it is not a valid clique.
Compare a five-vertex group with all ten possible edges to one missing just the edge between vertices 2 and 3; only the first is complete. section 11.1
