Let A and B be two finite disjoint sets of points in the plane such that no three distinct
points in A∪B are collinear. Assume that at least one of the sets A,B contains at least five points. Show that there exists a triangle all of whose vertices are contained in A or in B that does not contain in its interior any point from the other set. combinatorics unsolvedcombinatorics