3.7.148. Maximum clique
A constraint (i.e., ) that can be used for searching for a maximum clique in a graph, or a constraint (i.e., , , ) that can be stated by extracting a large clique [BronKerbosch73] from a specific graph of elementary constraints.
A maximum clique is a clique of maximum size, a clique being a subset of vertices such that each vertex is connected to all other vertices of the clique.