A better bound for ordinary triangles

TL;DR

The paper proves that large point sets not confined to two lines necessarily contain an 11-ordinary triangle, improving previous bounds significantly.

Contribution

It establishes a new lower bound for the existence of c-ordinary triangles in large point sets, reducing the maximum collinearity from 12000 to 11.

Findings

Large point sets contain 11-ordinary triangles

Improved the bound from 12000 to 11

Applicable when points are not on two lines

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$.