English

A quantitative variant of the multi-colored Motzkin-Rabin theorem

Combinatorics 2014-06-09 v1

Abstract

We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let V1,,VnRdV_1,\ldots,V_n \subset R^d be nn disjoint sets of points (of nn `colors'). Suppose that for every ViV_i and every point vViv \in V_i there are at least δVi\delta |V_i| other points uViu \in V_i so that the line connecting vv and uu contains a third point of another color. Then the union of the points in all nn sets is contained in a subspace of dimension bounded by a function of nn and δ\delta alone.

Keywords

Cite

@article{arxiv.1406.1530,
  title  = {A quantitative variant of the multi-colored Motzkin-Rabin theorem},
  author = {Zeev Dvir and Christian Tessier-Lavigne},
  journal= {arXiv preprint arXiv:1406.1530},
  year   = {2014}
}