### Abstract

We prove a quantitative version of the multi-colored Motzkin–Rabin theorem in the spirit of Barak et al. (Proceedings of the National Academy of Sciences, 2012): Let (Formula presented.) be (Formula presented.) disjoint sets of points (of (Formula presented.) ‘colors’). Suppose that for every (Formula presented.) and every point (Formula presented.) there are at least (Formula presented.) other points (Formula presented.) so that the line connecting (Formula presented.) and (Formula presented.) contains a third point of another color. Then the union of the points in all (Formula presented.) sets is contained in a subspace of dimension bounded by a function of (Formula presented.) and (Formula presented.) alone.

Original language | English (US) |
---|---|

Pages (from-to) | 38-47 |

Number of pages | 10 |

Journal | Discrete and Computational Geometry |

Volume | 53 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2015 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

### Keywords

- Algebraic methods
- Point configurations
- Sylvester–Gallai

## Fingerprint Dive into the research topics of 'A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem'. Together they form a unique fingerprint.

## Cite this

*Discrete and Computational Geometry*,

*53*(1), 38-47. https://doi.org/10.1007/s00454-014-9647-9