Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 5 Jun 2014 in math.CO | (1406.1530v1)

Abstract: We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let $V_1,\ldots,V_n \subset Rd$ be $n$ disjoint sets of points (of $n$ `colors'). Suppose that for every $V_i$ and every point $v \in V_i$ there are at least $\delta |V_i|$ other points $u \in V_i$ so that the line connecting $v$ and $u$ contains a third point of another color. Then the union of the points in all $n$ sets is contained in a subspace of dimension bounded by a function of $n$ and $\delta$ alone.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.