On A Problem of P. Erdos

DOI10.2307/2312883MaRDI QIDQ5583665zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Cited in

(15)

• Convex polygons with few intervertex distances
• Intervertex distances in convex polygons
• Complexity, convexity, and unimodality
• 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
• Maximum planar sets that determine k distances
• Distance Sets on Circles
• 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)