On grids in point-line arrangements in the plane
Abstract
The famous Szemer\'edi-Trotter theorem states that any arrangement of n points and n lines in the plane determines O(n4/3) incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for point-line incidence. Let L1 and L2 be two sets of t lines in the plane and let P=\1 2 : 1 ∈ L1, 2 ∈ L2\ be the set of intersection points between L1 and L2. We say that (P, L1 L2) forms a natural t× t grid if |P| =t2, and conv(P) does not contain the intersection point of some two lines in Li, for i = 1,2. For fixed t > 1, we show that any arrangement of n points and n lines in the plane that does not contain a natural t× t grid determines O(n43- ) incidences, where = (t). We also provide a construction of n points and n lines in the plane that does not contain a natural 2 × 2 grid and determines at least (n1+114) incidences.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.