In graph theory, a clique is a fully connected subgraph. A fully connected or complete graph is one wherein every vertex is connected by an edge to every other vertex in the graph.

The clique problem is: given a graph G and an integer k, is there a clique with >= k vertices?

The clique problem has been proven to be np-complete