A one-page solution of a problem of Erdős and Purdy

DOI10.1007/S00454-019-00139-1MaRDI QIDQ2197690zbMATH OpenOpenAlexFDO

Authors Rom Pinchasi, Aleksandr A. Polyanskii

Publication date 1 September 2020

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-019-00139-1

zbMATH Keywords

collinear tripleslinespoints

Mathematics Subject Classification ID

Configuration theorems in linear incidence geometry (51A20) Linear incidence geometry (51A99) Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Review text

The following conjecture has been attributed to [\textit{P. Erdős} and \textit{G. Purdy}, J. Comb. Theory, Ser. A 25, 205--210 (1978; Zbl 0422.05023)]: Assume \(P\) is a set of \(n\) points in general position in the plane, where \(n > 4\) is even. Assume \(R\) is another set of points disjoint from \( P\), such that every line through two points of \(P\) contains a point from \(R\). Then \(|R|\geq n\). By now, the conjecture has several proofs. The paper under review provides a short and elementary, one-page proof to the conjecture. This proof may be the ``book proof of the result.

Recommendations

• A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Extremal problems in discrete geometry
• Research problems
• Problems related to a de Bruijn-Erdös theorem

Cites work

• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Generalized hyperfocused arcs in PG(2,p)
• Some combinatorial problems in the plane
• Sylvester's Problem on Collinear Points and a Relative
• There are not too many magic configurations

Cited in

(7)

• A combinatorial problem on polynomials and rational functions
• A note on the minimum number of red lines needed to pierce the intersections of blue lines
• On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy
• Research problems
• Extremal problems in discrete geometry

This page was built for publication: A one-page solution of a problem of Erdős and Purdy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197690)