Abstract

The Szemerédi–Trotter theorem [Combinatorica, 3 (1983), pp. 381–392] gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that n lines and n points determine $O(n^{4/3})$ incidences. Let us suppose that an arrangement of n lines and n points defines $cn^{4/3}$ incidences, for a given positive c. It is widely believed that such arrangements have special structure, but no results are known in this direction. Here we show that for any natural number, k, one can find k points of the arrangement in general position such that any pair of them is incident to a line from the arrangement, provided by $n\geq n_0(k)$. In a subsequent paper we will establish a similar statement for hyperplanes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.