Consider the following problems:

k-Independent Set

Let $ G=(V,E)$ be an undirected graph and $ k$ be a natural number. k-Independent-Set asks if there exists a subset $ C\subseteq V$ of size $ k$ of nodes from $ G$ such that all nodes from $ G$ are independent: $ \forall u,v \in V . (u,v)\not\in E$ .

Subset Sum

Partition