# Max clique problem (graph)
Last edited: 2026-02-05
# 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 .
Last edited: 2026-02-05
Given an undirected graph $G = (V,E)$ what is the largest $S \subset V$ such that the induced graph on $S$ forms a clique .