Ex1: show that in R^3, there exist n point sets (for all n >=6) such that the plane defined by every 3 points not on a line contains at least one more point of the point set. (give a construction of such a set)
EX2: show that any partition of K_n into complete bipartite graphs requires at least n-1 such graphs.