OurBigBook About$ Donate
 Sign in Sign up

Rich line bound (L≥k​=O(n2/k3+n/k))

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Incidence geometry Szemerédi–Trotter theorem
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For n distinct points in the real plane, L≥k​ counts lines containing at least k≥2 points. The Szemerédi–Trotter theorem applied to these lines gives the bound by absorbing its additive line-count term; bounded k follows by counting point pairs. Consequently, summing occupancies of lines with at least k points by dyadic ranges gives O(n2/k2+nlogn).

 Ancestors (6)

  1. Szemerédi–Trotter theorem
  2. Incidence geometry
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 13 / 3 / Solution
  • Rich-bisector deletion bound

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook