Clique Decision Problem

Output: Determine if G has a k-clique, that is, there is a set of vertices U of size k such that for each pair of vertices in U there is and edge in E between them.

Input: Undirected Graph G = (V,E) and a number k.