Problem 211

Let $1\leq k<n$ . Given $n$ points in $\mathbb{R}^2$ , at most $n-k$ on any line, there are $\gg kn$ many lines which contain at least two points.

Status

SolvedProved

An accepted solution exists. The statement is true.

BGS74: Burr, Stefan A. and Grünbaum, Branko and Sloane, N. J. A., The orchard problem. Geometriae Dedicata (1974), 397-424.
Be83: Beck, József, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry. Combinatorica (1983), 281-297.
Er84: Erdős, P., Research problems. Period. Math. Hungar. (1984), 101-103.
FuPa84: Füredi, Z. and Palásti, I., Arrangements of lines with a large number of triangles. Proc. Amer. Math. Soc. (1984), 561-566.
SzTr83: Szemerédi, Endre and Trotter, Jr., William T., Extremal problems in discrete geometry. Combinatorica (1983), 381-392.