3.7.141. 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.