Summary
One of Paul Erdős’s many continuing interests is distances between points in finite sets. We focus here on conjectures and results on intervertex distances in convex polygons in the Euclidean plane. Two conjectures are highlighted. Let t(x) be the number of different distances from vertex x to the other vertices of a convex polygon C, let T(C) = Σt(x), and take T n = min{T(C) : C has n vertices}. The first conjecture is \(T_n = \left( {_2^n } \right)\). The second says that if \(T\left(C\right) = \left( {_2^n } \right)\) for a convex n-gon, then the n-gon is regular if n is odd, and is what we refer to as bi-regular if n is even. The conjectures are confirmed for small n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Altman, On a problem of P. Erdős, Amer. Math. Monthly 70 (1963) 148–157.
H. Edelsbrunner and P. Hajnal, A lower bound on the number of unit distances between the vertices of a convex polygon, J. Combin. Theory A 56 (1991) 312–316.
P. Erdős, On sets of distances of n points, Amer. Math. Monthly 53 (1946) 248–250.
P. Erdős and P. Fishburn, Multiplicities of interpoint distances in finite planar sets, Discrete Appl. Math, (to appear).
P. Erdős and P. Fishburn, Intervertex distances in convex polygons, Discrete Appl. Math, (to appear).
P. Erdős and P. Fishburn, A postscript on distances in convex n-gons, Discrete Comput. Geom. 11 (1994) 111–117.
P. Erdős and L. Moser, Problem 11, Canad. Math. Bull. 2 (1959) 43.
P. Fishburn, Convex polygons with few intervertex distances, DIM ACS report 92–18 (April 1992), AT&T Bell Laboratories, Murray Hill, NJ.
P. Fishburn, Convex polygons with few vertices, DIMACS report 92–17 (April 1992), AT&T Bell Laboratories, Murray Hill, NJ.
P. C. Fishburn and J. A. Reeds, Unit distances between vertices of a convex polygon, Comput. Geom.: Theory and Appls. 2 (1992) 81–91.
Z. Fiiredi, The maximum number of unit distances in a convex n-gon, J. Combin. Theory A 55 (1990) 316–320.
L. Moser, On the different distances determined by n points, Amer. Math. Monthly 59 (1952) 85–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fishburn, P. (1997). Distances in Convex Polygons. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös II. Algorithms and Combinatorics, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60406-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-60406-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64393-4
Online ISBN: 978-3-642-60406-5
eBook Packages: Springer Book Archive