Andere Kunden interessierten sich auch für
![De Bruijn Erd's Theorem (incidence geometry)]( "De Bruijn Erd's Theorem (incidence geometry)")
De Bruijn Erd's Theorem (incidence geometry)25,99 €![Euler's Theorem (differential geometry)]( "Euler's Theorem (differential geometry)")
Euler's Theorem (differential geometry)25,99 €![Cauchy's Theorem (geometry)]( "Cauchy's Theorem (geometry)")
Cauchy's Theorem (geometry)19,99 €![Euler's Theorem in Geometry]( "Euler's Theorem in Geometry")
Euler's Theorem in Geometry25,99 €![Kakutani's Theorem (geometry)]( "Kakutani's Theorem (geometry)")
Kakutani's Theorem (geometry)22,99 €![Hilbert's Theorem (differential geometry)]( "Hilbert's Theorem (differential geometry)")
Hilbert's Theorem (differential geometry)29,99 €![Klein Geometry]( "Klein Geometry")
Klein Geometry22,99 €
High Quality Content by WIKIPEDIA articles! In the context of discrete geometry, Beck's theorem may refer to several different results, two of which are given below. Both appeared, alongside several other important theorems, in a well-known paper by József Beck. The two results described below primarily concern lower bounds on the number of lines determined by a set of points in the plane. (Any line containing at least two points of point set is said to be determined by that point set.) The Erd s Beck theorem is a variation of a classical result by L.M. Kelly and W.O.J. Moser involving configurations of n points of which at most n k are collinear, for some 0kn 1. They showed that if n is sufficiently large then the configuration spans at least kn (1/2)(3k+2)(k 1) lines.