Abstract
Let P be a set of n blue points in the plane, not all on a line. Let R be a set of m red points such that P ∩ R = ∅ and every line determined by P contains a point from R. We provide an answer to an old problem by Grünbaum and Motzkin [9] and independently by Erdős and Purdy [6] who asked how large must m be in terms of n in such a case? More specifically, both [9] and [6] were looking for the best absolute constant c such that m ≥ cn. We provide an answer to this problem and show that m ≥ (n−1)/3.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in Combinatorial geometry, Combinatorica 3 (1983), 281–297.
M. Bern, D. Eppstein and F. Yao, Horizon theorems for lines and polygons, in Discrete and Computational Geometry (New Brunswick, NJ, 1989/1990), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6, American Mathematical Society, Providence, RI, 1991, pp. 45–66.
G. D. Chakerian, Sylvester’s problem on collinear points and a relative, The American Mathematical Monthly 77 (1970), 164–167.
B. Chazelle, L. J. Guibas and D. T. Lee, The power of geometric duality, BIT 25 (1985), 76–90.
G. A. Dirac, Collinearity properties of sets of points, The Quarterly Journal of Mathematics 2 (1951), 221–227.
P. Erdős and G. Purdy, Some combinatorial problems in the plane, Journal of Combinatorial Theory. Series A 25 (1978), 205–210.
J. E. Goodman and R. Pollack, A combinatorial perspective on some problems in geometry, in Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (B aton Rouge, La., 1981), Congressus Numerantium, Vol. 32, 1981, pp. 383–394.
J. E. Goodman and R. Pollack, Allowable sequences and order types in discrete and computational geometry, in New Trends in Discrete and Computational Geometry (J. Pach, ed.), Algorithms and Combinatorics, Vol. 10, Springer, Berlin, 1993, pp. 103–134.
B. Grünbaum, Arrangements of colored lines, Abstract 720-50-5, Notices of the American Mathematical Society 22 (1975), A–200.
B. Grünbaum, Monochromatic intersection points in families of colored lines, Geombinatorics 9 (1999), 3–9.
R. E. Jamison, Survey of the slope problem, in Discrete Geometry and Convexity, Annals of the New York Acadamey of Sciences, Vol. 440, New York Academy of Sciences, New York, 1985, pp. 34–51.
R. E. Jamison and D. Hill, A catalogue of sporadic slope-critical configurations, in Proceedings of the Fourteenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, Fla., 1983), Congressus Numerantium, Vol. 40, 1983, pp. 101–125.
B. D. Lund, G. B. Purdy and J. W. Smith, Some results related to a conjecture of Dirac’s arXiv:1202.3110v1.
T. S. Motzkin, Nonmixed connecting lines, Abstract 67T 605, Notices of the American Mathematical Society 14 (1967), 837.
J. Pach, R. Pinchasi and M. Sharir, On the number of directions determined by a threedimensional point set, Journal of Combinatorial Theory. Series A 108 (2004), 1–16. Also in Proc. 19th Annu. ACM Sympos. Comput. Geom., 2003, pp. 106–113.
J. Pach, R. Pinchasi and M. Sharir, Solution of Scott’s problem on the number of directions determined by a point set in 3-space, Discrete & Computational Geometry 38 (2007), 399–441.
J. Pach, R. Radoičić, G. Tardos and G. Tóth, Improving the Crossing Lemma by finding more crossings in sparse graphs, Discrete & Computational Geometry 36 (2006), 527–552.
M. Payne and D. R. Wood, Progress on Dirac’s conjecture, arXiv:1207.3594v1.
P. R. Scott, On the sets of directions determined by n points, The American Mathematical Monthly 77 (1970), 502–505.
E. Szemerédi and W. T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), 381–392.
P. Ungar, 2N noncollinear points determine at least 2N directions, Journal of Combinatorial Theory. Series A 33 (1982), 343–347.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pinchasi, R. A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane. Isr. J. Math. 198, 205–214 (2013). https://doi.org/10.1007/s11856-013-0023-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-013-0023-x