Tight bounds on a problem of lines and intersections

Abstract

Consider all arrangements of lines in the plane with r distinct slopes. What is the smallest number of lines f(r) in which there are at least f(r) + 1 points, each defined by the intersection of r lines? We improve the previous lower bound, showing f(r) = Θ(r3). © 1991.