title: Reducing independent set to clique?
body: <p>Show that given a graph G and a number k, there is some way to transform it to a graph H such that G has an independent set of size of size at least k if and only if H has a clique of size at least k.</p>