Every large point set contains many collinear points or an empty pentagon (Q659671)

The paper shows that for every \(k\), a sufficiently large set of points in the plane has \(k\) collinear points or a convex pentagon with no more points in the pentagon or on its boundary. This implies the next open case of a conjecture of \textit{J. Kára, A. Pór} and \textit{D. R. Wood} [Discrete Comput. Geom. 34, No. 3, 497--506 (2005; Zbl 1074.05036)] on ``big line or big clique'' for visibility graphs.