On A Problem of P. Erdos
From MaRDI portal
Publication:5583665
DOI10.2307/2312883zbMATH Open0189.22904OpenAlexW4242264976MaRDI QIDQ5583665FDOQ5583665
Authors:
Publication date: 1963
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2312883
Cited In (15)
- Convex polygons with few intervertex distances
- Complexity, convexity, and unimodality
- Intervertex distances in convex polygons
- On the graph of large distances
- A postscript on distances in convex \(n\)-gons
- Computational geometric aspects of rhythm, melody, and voice-leading
- Multiplicities of interpoint distances in finite planar sets
- Integer complexity and well-ordering
- Problems, problems, problems
- On the number of occurrences of the \(k\)th smallest distance between points in convex position
- Uniqueness of maximum planar five-distance sets
- Counting large distances in convex polygons: a computational approach
- Distance Sets on Circles
- Maximum planar sets that determine \(k\) distances
- On 5-isosceles sets in the plane, with linear restriction
This page was built for publication: On A Problem of P. Erdos
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583665)