A one-page solution of a problem of Erdős and Purdy
DOI10.1007/S00454-019-00139-1zbMATH Open1448.52014OpenAlexW2980534072MaRDI QIDQ2197690FDOQ2197690
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
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
Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Linear incidence geometry (51A99) Configuration theorems in linear incidence geometry (51A20)
Cites Work
- Some combinatorial problems in the plane
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
- Sylvester's Problem on Collinear Points and a Relative
- There are not too many magic configurations
- Generalized hyperfocused arcs in \(PG(2,p)\)
Cited In (6)
- 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 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
- Extremal problems in discrete geometry
- Title not available (Why is that?)
- Research problems
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)
