Abstract
A planar point set S is called an integral set if all the distances between the elements of S are integers. We prove that any integral set contains many collinear points or the minimum distance should be relatively large if |S| is large.
Article PDF
Similar content being viewed by others
References
A. Anning and P. Erdös, Integral distances, Bull. Amer. Math. Soc. 51 (1945), 548–560.
P. Erdös, Integral distances, Bull. Amer. Math. Soc. 51 (1945), 966.
P. Erdös, On some elementary problems in geometry, Köz. Mat. Lapok 61(7) (1980), 49–54 (in Hungarian).
H. Harborth, Integral distances in point sets, Charlemagne and His Heritage. 1200 Years of Civilization and Science in Europe, Vol. 2, pp. 213–224, Brepols, Turnhout, 1998.
H. Harborth and A. Kemnitz, Diameters of integral point sets, Intuitive Geometry (Siófok, 1985), pp. 255–266, Colloq. Math. Soc. János Bolyai, 48, North-Holland, Amsterdam, 1987.
H. Harborth A. Kemnitz M. Möller (1993) ArticleTitleAn upper bound for the minimum diameter of integral point sets Discrete Comput. Geom. 9 427–432 Occurrence Handle93m:52018 Occurrence Handle0784.52020
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th edition, p. 63, Oxford University Press, London, 1979.
G. B. Huff, Diophantine problems in geometry and elliptic ternary forms, Duke Math. J. 15 (1948), 443–453.
H. Maehara (1992) ArticleTitleDistance graphs in Euclidean space Ryukyu Math. J. 5 33–51 Occurrence Handle93k:52023 Occurrence Handle0776.05041
H. Maehara K. Ota N. Tokushige (1997) ArticleTitleEvery graph is an integral distance graph in the plane Combin. Theory Ser. A 80 290–294 Occurrence Handle10.1006/jcta.1997.2826 Occurrence Handle98m:05054 Occurrence Handle0884.05037
W. D. Peeples SuffixJr. (1954) ArticleTitleElliptic curves and rational distance sets Proc. Amer. Math. Soc. 5 29–33 Occurrence Handle15,645f Occurrence Handle0055.14601
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Solymosi, J. Note on Integral Distances. Discrete Comput Geom 30, 337–342 (2003). https://doi.org/10.1007/s00454-003-0014-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-0014-7