Construct · 1 fields · 1 citations

Szemerédi-Trotter theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational geometry

the result that n points and m lines in the plane have at most on the order of n^(2/3) m^(2/3) + n + m incidences.

In computational geometry, Szemerédi-Trotter theorem refers to the result that n points and m lines in the plane have at most on the order of n^(2/3) m^(2/3) + n + m incidences. This meaning comes from Szemerédi (1983) in Combinatorica.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Szemerédi-Trotter theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

order4 fields · 6 citationsjingle · one word, four constructs plane1 fields · 1 citationsanchor · a standalone construct

References

Szemerédi, E., & Trotter, W. T. (1983). Extremal problems in discrete geometry. Combinatorica, 3(3-4), 381-392. https://doi.org/10.1007/bf02579194

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct