Unit distance graph

In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one. Edges of unit distance graphs sometimes cross each other, so they are not always planar.

The Hadwiger–Nelson problem concerns the chromatic number of unit distance graphs. It is known that there exist unit distance graphs requiring four colors in any proper coloring, and that all such graphs can be colored with at most seven colors.

For any algebraic number "A", it is possible to find a unit distance graph "G" in which some pair of vertices are at distance "A" in any unit distance representation of "G" (Maehara 1991).

Examples

The following graphs are unit distance graphs:
* Any cycle graph
* Any grid graph
* Any hypercube graph
* The Petersen graph
* The wheel graph "W"₇

Counting unit distances

Erdős (1946) posed the problem of estimating how many pairs of points in a set of "n" points could be at unit distance from each other. In graph theoretic terms, how dense can a unit distance graph be?

The hypercube graph provides a lower bound on the number of unit distances proportional to $nlog\; n.$ By considering points in a square grid with carefully chosen spacing, Erdős found an improved lower bound of the form

:$n^\{1+frac\{c\}\{loglog\; n,$

and offered a prize of $500 for determining whether or not the maximum number of unit distances can also be upper bounded by a function of this form (Kuperberg 1992). The best known upper bound for this problem, due to Spencer, Szemerédi, and Trotter (1984), is proportional to

:$n^\{frac43\};$this bound can also be viewed as counting incidences between points and unit circles, and is closely related to the Szemerédi–Trotter theorem on incidences between points and lines.

Generalization to higher dimensions

The definition of a unit distance graph may naturally be generalized to any higher dimensional Euclidean space.Any graph may be embedded as a set of points in a sufficiently high dimension; Maehara and Rödl (1990) show that the dimension necessary to embed a graph in this way may be bounded by twice its maximum degree.

See also

* Unit disk graph

References

* cite journal
author = Erdős, Paul
authorlink = Paul Erdős
title = On sets of distances of "n" points
journal = American Mathematical Monthly
volume = 53
year = 1946
pages = 248–250
doi = 10.2307/2305092

* cite web
author = Kuperberg, Greg
year = 1992
title = The Erdos kitty: At least $9050 in prizes!
work = Posting to usenet groups rec.puzzles and sci.math
url = http://www.math.niu.edu/~rusin/known-math/93_back/prizes.erd

* cite journal
journal = Discrete Applied Mathematics
volume = 31
issue = 2
year = 1991
pages = 193–200
doi = 10.1016/0166-218X(91)90070-D
title = Distances in a rigid unit-distance graph in the plane
author = Maehara, Hiroshi

* cite journal
author = Maehara, Hiroshi; Rödl, Vojtech
title = On the dimension to represent a graph by a unit distance graph
journal = Graphs and Combinatorics
volume = 6
issue = 4
year = 1990
pages = 365–367
doi = 10.1007/BF01787703

* cite conference
author = Spencer, Joel; Szemerédi, Endre; Trotter, William T.
title = Unit distances in the Euclidean plane
booktitle = Graph Theory and Combinatorics
publisher = Academic Press
year = 1984
pages = 293–308

External links

* cite web
author = Venkatasubramanian, Suresh
title = Problem 39: Distances among Point Sets in R² and R³
work = The Open Problems Project
url = http://maven.smith.edu/~orourke/TOPP/P39.html

*