A survey of Sylvester's problem and its generalizations (Q2638534)

The authors survey a number of results related to Sylvester's problem: given a finite set of three or more noncollinear points in the plane, then there exists a line containing exactly two of the points. The history of Sylvester's problem and a few solutions are presented; generalizations to higher dimension are also included. A section surveys results on the connecting lines of n noncollinear points. A section is devoted to the following problem: a finite collection of disjoint point sets is given, is there a line intersecting exactly two members of the family? The problem of the last section is as follows: assume the points of a finite point set are coloured. Is there a monochromatic line containing at least two vertices? More than 80 references are given.