A survey of Sylvester's problem and its generalizations

SummaryLetP be a finite set of three or more noncollinear points in the plane. A line which contains two or more points ofP is called aconnecting line (determined byP), and we call a connecting lineordinary if it contains precisely two points ofP. Almost a century ago, Sylvester posed the disarmingly simple question:Must every set P determine at least one ordinary line? No solution was offered at that time and the problem seemed to have been forgotten. Forty years later it was independently rediscovered by Erdös, and solved by Gallai. In 1943 Erdös proposed the problem in the American Mathematical Monthly, still unaware that it had been asked fifty years earlier, and the following year Gallai's solution appeared in print. Since then there has appeared a substantial literature on the problem and its generalizations.In this survey we review, in the first two sections, Sylvester's problem and its generalization to higher dimension. Then we gather results about the connecting lines, that is, the lines containing two or more of the points. Following this we look at the generalization to finite collections of sets of points. Finally, the points will be colored and the search will be for monochromatic connecting lines.

[1]  R. Bellman,et al.  Problems for Solution: 4065-4069 , 1943 .

[2]  Barbara Steinberg.  Clubs and Allied Activities , 1944 .

[3]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[4]  H. Coxeter.  A Problem of Collinear Points , 1948 .

[5]  G. Dirac.  COLLINEARITY PROPERTIES OF SETS OF POINTS , 1951 .

[6]  T. Motzkin.  The lines and planes connecting the points of a finite set , 1951 .

[7]  D. W. Lang.  2577. The dual of a well-known theorem , 1955 .

[8]  W. Moser,et al.  On the Number of Ordinary Lines Determined by n Points , 1958, Canadian Journal of Mathematics.

[9]  L. Kelly,et al.  A generalization of the theorem of Sylvester , 1960 .

[10]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[11]  An Enumeration of the Five Parallelohedra , 1961, Canadian Mathematical Bulletin.

[12]  A further theorem of the Sylvester type , 1963 .

[13]  V. Klee,et al.  Combinatorial Geometry in the Plane , 1964 .

[14]  Sten Hansen.  A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set. , 1965 .

[15]  M. Edelstein,et al.  Bisecants of Finite Collections of Sets in Linear Spaces , 1966, Canadian Journal of Mathematics.

[16]  Robert J. Silverman,et al.  Extensions of Sylvester's Theorem , 1966, Canadian Mathematical Bulletin.

[17]  H. S. M. Coxeter,et al.  Twelve Geometric Essays , 1968 .

[18]  D. W. Crowe,et al.  Sylvester's Problem on Collinear Points , 1968 .

[19]  L. M. Kelly,et al.  A characterization of sets of n points which determine n hyperplanes , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  V. C. Williams,et al.  A Proof of Sylvester's Theorem on Collinear Points , 1968 .

[21]  Hyperplanes and Lines Associated with Families of Compact Sets in Locally Convex Spaces. , 1969 .

[22]  Douglas R. Woodall.  The λ—μ Problem , 1969 .

[23]  G. D. Chakerian.  Sylvester's Problem on Collinear Points and a Relative , 1970 .

[24]  L. M. Kelly,et al.  On the Number of Ordinary Planes , 1971, J. Comb. Theory, Ser. A.

[25]  G. Purdy.  Some extremal problems in geometry , 1971 .

[26]  On finite sets of points inP3 , 1971 .

[27]  B. Grünbaum.  Arrangements and Spreads , 1972 .

[28]  Leroy Kelly,et al.  Simple points in pseudoline arrangements , 1972 .

[29]  P. Erdös,et al.  On a Problem of Groübaum , 1972, Canadian Mathematical Bulletin.

[30]  Branko Grünbaum.  New Views on Some Old Questions of Combinatorial Geometry , 1973 .

[31]  N. Sloane,et al.  The orchard problem , 1974 .

[32]  Walter Meyer.  On ordinary points in arrangements , 1974 .

[33]  Paul Erdös.  On some problems of elementary and combinatorial geometry , 1975 .

[34]  Theodore S. Motzkin.  Sets for Which No Point Lies on Many Connecting Lines , 1975, J. Comb. Theory, Ser. A.

[35]  Monochromatic Lines in the Plane , 1975 .

[36]  P. Os,et al.  Problems and Results in Combinatorial Analysis , 1978 .

[37]  F. A. Bostock,et al.  A Gallai-Type Problem , 1978, J. Comb. Theory, Ser. A.

[38]  Monochrome Lines in the Plane , 1979 .

[39]  On configurations in 3-space without elementary planes and on the number of ordinary planes. , 1980 .

[40]  Kym S. Watson.  Sylvester's problem for spreads of curves , 1980 .

[41]  P. Erdös.  Some combinational problems in geometry , 1980 .

[42]  Solutions: Solution to problem in number 4, p. 250 , 1980 .

[44]  Singular points in planar finite sets I , 1982 .

[45]  Peter B. Borwein.  On Monochrome Lines and Hyperplanes , 1982, J. Comb. Theory, Ser. A.

[46]  P. Erdős.  Personal reminiscences and remarks on the mathematical work of Tibor Gallai , 1982 .

[47]  Peter B. Borwein.  The Desmic Conjecture , 1983, J. Comb. Theory, Ser. A.

[48]  Peter Borwein,et al.  A Conjecture Related to Sylvester's Problem , 1983 .

[49]  József Beck,et al.  On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry , 1983, Comb..

[50]  Peter Borwein.  On Sylvester's problem and Haar spaces. , 1983 .

[51]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[52]  Endre Szemerédi,et al.  A Combinatorial Distinction Between the Euclidean and Projective Planes , 1983, Eur. J. Comb..

[53]  Paul Erdös,et al.  Some Old and New Problems in Combinatorial Geometry , 1984 .

[54]  Peter Borwein,et al.  Sylvester’s problem and Motzkin’s theorem for countable and compact sets , 1984 .

[55]  L. M. Kelly,et al.  A resolution of the sylvester-gallai problem of J.-P. serre , 1986, Discret. Comput. Geom..

[56]  Paul Erdös,et al.  The Solution to a Problem of Grünbaum , 1988, Canadian Mathematical Bulletin.

[57]  Zoltán Füredi,et al.  On representing sylvester-gallai designs , 1989, Discret. Comput. Geom..

[58]  H. Coxeter,et al.  The Real Projective Plane , 1992 .

[59]  P. Erdos.  Problems and Results in Combinatorial Analysis , 2022 .