### 3.7.148. Maximum clique

A constraint (i.e., $\mathrm{𝚌𝚕𝚒𝚚𝚞𝚎}$) that can be used for searching for a maximum clique in a graph, or a constraint (i.e., $\mathrm{𝚊𝚕𝚕}_\mathrm{𝚖𝚒𝚗}_\mathrm{𝚍𝚒𝚜𝚝}$, $\mathrm{𝚊𝚕𝚕𝚍𝚒𝚏𝚏𝚎𝚛𝚎𝚗𝚝}$, $\mathrm{𝚍𝚒𝚜𝚓𝚞𝚗𝚌𝚝𝚒𝚟𝚎}$) 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.