English

A better bound for ordinary triangles

Combinatorics 2018-06-28 v2

Abstract

Let PP be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of PP such that each line spanned by the points contains at most cc points of PP. We show that if PP is not contained in the union of two lines and P|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=12000c=12000.

Keywords

Cite

@article{arxiv.1805.06954,
  title  = {A better bound for ordinary triangles},
  author = {Quentin Dubroff},
  journal= {arXiv preprint arXiv:1805.06954},
  year   = {2018}
}
R2 v1 2026-06-23T01:59:15.415Z