In discrete geometry, Beck's theorem refers to any of several related results proved by Jozsef Beck in a 1983 paper published in Combinatorica, establishing lower bounds on the number of lines determined by a finite set of points in the plane, where a line counts as determined if it passes through at least two of the points. The theorem's original proof used a constant later shown to be far from optimal, and the true best possible constants remain unknown. A related and stronger result, the Erdos-Beck theorem, implies Beck's theorem though it was not stated in Beck's own paper.
Facts
StatementFinite collections of points in the plane fall into one of two extremes: a large fraction of points lie on a single line, or a large number of lines are needed to connect all the points. 1 Classification
Statement Form Connections
Has Statement Form
In Branch
Source Beck's theorem (geometry) - Wikipedia
Principal Result Of
Source Beck's theorem (geometry) - Wikipedia
Proved By
Source Beck's theorem (geometry) - Wikipedia
Sources
1. Beck's theorem (geometry) - Wikipedia
Beck's theorem
Beck's theorem says that finite collections of points in the plane fall into one of two extremes
Proved By: Paul Erdos, Article text
This result was first conjectured by Erdős, and proven by Beck.
Principal Result Of: József Beck, Lead sentence of the article on the result
Both appeared, alongside several other important theorems, in a well-known paper by József Beck.
In Branch: Discrete Geometry, Lead sentence
In discrete geometry, Beck's theorem is any of several different results, two of which are given below.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.