Clique problem

The Clique problem is a well-known problem in graph theory and computer science, particularly within the field of computational complexity. A clique in a graph is defined as a subset of vertices such that every two distinct vertices in the subset are adjacent, which means there is an edge connecting every pair of vertices in that subset.