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 \(V_1,\ldots ,V_n \subset {\mathbb {R}}^d\) 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.
Similar content being viewed by others
Notes
One could set \(\varepsilon = \delta /2\) to get a simpler (but worse, in some cases) bound.
References
Barak, B., Dvir, Z., Wigderson, A., Yehudayoff, A.: Fractional Sylvester–Gallai theorems. Proc. Natl. Acad. Sci. USA (2012)
Borwein, P.: On monochrome lines and hyperplanes. J. Comb. Theory Ser. A 33, 76–81 (1982)
Borwein, P., Moser, W.O.J.: A survey of Sylvester’s problem and its generalizations. Aequ. Math. 40(1), 111–135 (1990)
Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Chakerian, G.D.: Sylvester’s problem on collinear points and a relative. Am. Math. Mon. 77, 164–167 (1970)
Dvir, Z., Saraf, S., Wigderson, A.: Improved rank bounds for design matrices and a new proof of Kelly’s theorem. Forum Math. Sigma (2014). doi:10.1017/fms.2014.2
Grünbaum, B.: Monochromatic intersection points in families of colored lines. Geombinatorics 9, 3–9 (1999)
Motzkin, T.S.: Nonmixed connecting lines, Abstract 67T 605. Notices Am. Math. Soc. 14, 837 (1967)
Shannon, R.W.: Certain extremal problems in arrangements of hyperplanes. Ph.D. Thesis, University of Washington, Seattle (1974)
Acknowledgments
Research partially supported by NSF Grants CCF-0832797, CCF-1217416 and by the Sloan fellowship
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dvir, Z., Tessier-Lavigne, C. A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem. Discrete Comput Geom 53, 38–47 (2015). https://doi.org/10.1007/s00454-014-9647-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-014-9647-9