A better bound for ordinary triangles

MaRDI QIDQ6301735zbMATH OpenFDO

Authors Quentin Dubroff

Publication date 17 May 2018

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the union of two lines and $|P|$ is sufficiently large, then it contains an 11-ordinary triangle. This improves upon a result of Fulek et al., who showed one may take $c=12000$.

This page was built for publication: A better bound for ordinary triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301735)