A one-page solution of a problem of Erdős and Purdy
From MaRDI portal
Publication:2197690
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
(6)- A note on the minimum number of red lines needed to pierce the intersections of blue lines
- Research problems
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
- On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
- A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy
- 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)