# Max clique problem (graph)Last edited: 2026-02-05# StatementMax clique size problemGiven an undirected graph $G = (V,E)$ what is the largest $S \subset V$ such that the induced graph on $S$ forms a clique .# TheoryMax clique problem is NP-hard# Related problemsMax independent set problem (graph)Clique of a given size problem