graph theory : given graph g with n vertices, prove that ? (¯) ? n
[a hint that was given to us is to consider what will happen to the maximal independent set in the compliment graph, since we know that ? (g)q ? n, where "q" is the largest independent set in g]