# On the graph of large distances

Article

First Online:

- 98 Downloads
- 7 Citations

## Abstract

For a set*S* of points in the plane, let*d*_{1}>*d*_{2}>... denote the different distances determined by*S.* Consider the graph*G*(*S, k*) whose vertices are the elements of*S*, and two are joined by an edge iff their distance is at least*d*_{ k }. It is proved that the chromatic number of*G*(*S, k*) is at most 7 if |*S*|≥const*k*^{2}. If*S* consists of the vertices of a convex polygon and |*S*|≥const*k*^{2}, then the chromatic number of*G*(*S, k*) is at most 3. Both bounds are best possible. If*S* consists of the vertices of a convex polygon then*G*(*S, k*) has a vertex of degree at most 3*k* − 1. This implies that in this case the chromatic number of*G*(*S, k*) is at most 3*k*. The best bound here is probably 2*k*+1, which is tight for the regular (2*k*+1)-gon.

## Keywords

Chromatic Number Discrete Comput Geom Convex Polygon Convex Case Counterclockwise Order
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download
to read the full article text

## References

- 1.E. Altman (1963), On a problem of P. Erdős,
*Amer. Math. Monthly***70**, 148–157.zbMATHMathSciNetCrossRefGoogle Scholar - 2.E. Altman (1972), Some theorems on convex polygons,
*Canad. Math. Bull.***15**, 329–340.zbMATHMathSciNetCrossRefGoogle Scholar - 3.P. Erdős (1946), On sets of distances of
*n*points,*Amer. Math. Monthly***53**, 248–250.MathSciNetCrossRefGoogle Scholar - 4.P. Erdős (1960), On sets of distances of
*n*points in Euclidean space,*Magyar Tud. Akad. Mat. Kut. Int. Közl.***5**, 165–169.Google Scholar - 5.H. Hopf and E. Pannwitz (1934), Problem 167,
*Jahresber. Deutsch. Math.-Verein.***43**, 114.Google Scholar - 6.J. Spencer, E. Szemere'di, and W. T. Trotter (1984), Unit distances in the euclidean plane,
*Graph Theory and Combinatorics*, 293–305.Google Scholar - 7.
- 8.K. Vesztergombi (1985), On the distribution of distances in finite sets in the plane,
*Discrete Math.***57**, 129–146.zbMATHMathSciNetCrossRefGoogle Scholar - 9.K. Vesztergombi (1986), On large distances in planar sets,
*Discrete Math.*(to appear).Google Scholar - 10.G. Elekes, Bipartite graphs of distances (to appear).Google Scholar
- 11.P. Hajnal (1986), Private communication.Google Scholar
- 12.W. O. J. Moser and J. Pach (1986),
*Research Problems in Discrete Geometry*, McGill University, Montreal.Google Scholar

## Copyright information

© Springer-Verlag New York Inc. 1989