Statement Max clique size problem Given an undirected graph what is the largest such that the induced graph on forms a clique. Theory Max clique problem is NP-hard Related problems Max independent set problem (graph) Clique of a given size problem