A better bound for ordinary triangles

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.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…