- given a graph, find a set of vertices that are connected to all other vertices in the set - basically, find a subgraph of a graph s.t they form a [[Complete Graphs|Complete Graph]] https://www.geeksforgeeks.org/proof-that-clique-decision-problem-is-np-complete/