A better bound for ordinary triangles
Combinatorics
2018-06-28 v2
Abstract
Let be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of such that each line spanned by the points contains at most points of . We show that if is not contained in the union of two lines and is sufficiently large, then it contains an 11-ordinary triangle. This improves upon a result of Fulek et al., who showed one may take .
Cite
@article{arxiv.1805.06954,
title = {A better bound for ordinary triangles},
author = {Quentin Dubroff},
journal= {arXiv preprint arXiv:1805.06954},
year = {2018}
}