Max clique problem (graph)
programming
graph-theory
Statement
Max clique size problem
Given an undirected graph $G = (V,E)$ what is the largest $S \subset V$ such that the induced graph on $S$ forms a clique.
Given an undirected graph $G = (V,E)$ what is the largest $S \subset V$ such that the induced graph on $S$ forms a clique.