Abstract
The following theorem was conjectured by Erdős and Purdy: Let P be a set of \(n>4\) points in general position in the plane. Suppose that R is a set of points disjoint from P such that every line determined by P passes through a point in R. Then \(|R| \ge n\). In this paper we give a very elegant and elementary proof of this, being a very good candidate for the “book proof” of this conjecture.
This is a preview of subscription content, access via your institution.
References
Ackerman, E., Buchin, K., Knauer, C., Pinchasi, R., Rote, G.: There are not too many magic configurations. Discrete Comput. Geom. 39(1–3), 3–16 (2008)
Blokhuis, A., Marino, G., Mazzocca, F.: Generalized hyperfocused arcs in \(PG(2, p)\). J. Comb. Des. 22(12), 506–513 (2014)
Chakerian, G.D.: Sylvester’s problem on collinear points and a relative. Am. Math. Mon. 77, 164–167 (1970)
Erdős, P., Purdy, G.: Some combinatorial problems in the plane. J. Comb. Theory A 25(2), 205–210 (1978)
Grünbaum, B.: Arrangements of colored lines. Abstract 720–50-5. Notices Am. Math. Soc. 22, 200 (1975)
Milićević, L.: Classification theorem for strong triangle blocking arrangements (personal communication) (2018). arXiv:1809.08639
Motzkin, T.S.: Nonmixed connecting lines. Abstract 67T 605. Notices Am. Math. Soc. 14, 837 (1967)
Murty, U.S.R.: How many magic configurations are there? Am. Math. Mon. 78(9), 1000–1002 (1971)
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(1), 205–214 (2013)
Pinchasi, R.: Stabbing all lines determined by points in general position in the plane. Eur. J. Combin. (accepted)
Acknowledgements
We thank Gábor Tardos for a clever remark that helped to shorten the presentation of the proof.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Kenneth Clarkson
Dedicated to the memory of Branko Grünbaum.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
R. Pinchasi: Supported by ISF Grant (Grant No. 409/16). A. Polyanskii: Supported in part by the Leading Scientific Schools of Russia through Grant No. NSh-6760.2018.1.
Rights and permissions
About this article
Cite this article
Pinchasi, R., Polyanskii, A. A One-Page Solution of a Problem of Erdős and Purdy. Discrete Comput Geom 64, 382–385 (2020). https://doi.org/10.1007/s00454-019-00139-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-019-00139-1