Loading problem…
Status
On this page
Status
Topics
Status
On this page
Status
Topics
Call a sequence line-compatible if there is a set of points in such that there are lines containing at least two points, and the number of points on is exactly .
Prove that there are at most
many line-compatible sequences.
Source: erdosproblems.com/733
An accepted solution exists. The statement is true.
Proved. The site credits Szemerédi and Trotter, whose Theorem 4 bounds the number of line-compatible sequences by ; the accepted claim is their 1983 theorem.