1) Given the complete graph Kn on n vertices and m <= n, how
many subgraphs Km does Kn have?
2) Give a bijection between subsets of the vertices {v1, ....,
vn} of Kn and complete subgraphs of Kn.
3) How many subgraphs of Kn are there that are complete?