The maximum number of unit distances in a convex n-gon
- 1 November 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 55 (2) , 316-320
- https://doi.org/10.1016/0097-3165(90)90074-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A lower bound on the number of unit distances between the vertices of a convex polygonJournal of Combinatorial Theory, Series A, 1991
- A Problem of Leo Moser About Repeated Distances on the SphereThe American Mathematical Monthly, 1989
- On some metric and combinatorial geometric problemsDiscrete Mathematics, 1986
- Unit distancesJournal of Combinatorial Theory, Series A, 1984
- Extremal problems in discrete geometryCombinatorica, 1983
- On Sets of Distances of n PointsThe American Mathematical Monthly, 1946