Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
lines in the plane
points in the plane |
| gptkbp:field |
gptkb:combinatorial_geometry
incidence geometry |
| https://www.w3.org/2000/01/rdf-schema#label |
Szemerédi–Trotter theorem
|
| gptkbp:influenced |
incidence geometry
additive combinatorics |
| gptkbp:namedAfter |
gptkb:William_T._Trotter
gptkb:Endre_Szemerédi |
| gptkbp:publishedIn |
gptkb:Combinatorica
|
| gptkbp:sentence |
Gives an upper bound on the number of incidences between n points and m lines in the Euclidean plane.
|
| gptkbp:upperBound |
O(n^{2/3} m^{2/3} + n + m)
|
| gptkbp:usedIn |
gptkb:Erdős_distinct_distances_problem
algorithmic geometry sum-product problems |
| gptkbp:yearProved |
1983
|
| gptkbp:bfsParent |
gptkb:Endre_Szemerédi
|
| gptkbp:bfsLayer |
4
|