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 be disjoint sets of points (of `colors'). Suppose that for every and every point there are at least other points so that the line connecting and contains a third point of another color. Then the union of the points in all sets is contained in a subspace of dimension bounded by a function of and 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}
}