Independent set (graph)

In a graph $G = (V,E)$ a subset $I \subset V$ is an independent set if the induced subgraph on $I$ has no edges. (i.e. for all $(u,v) \in E$ either $u \not \in I$ or $v \not \in I$.)