|
|
| Line 1: |
Line 1: |
| [[File:Petersen graph, unit distance.svg|thumb|150px|right|The [[Petersen graph]] is a unit distance graph: it can be drawn in the plane with each edge having unit length.]]
| | Oscar is what my spouse loves to call me and I totally dig that title. To play baseball is the pastime he will never quit doing. Puerto Rico is where he's been residing for many years and he will never move. Since she was eighteen she's been working as a meter reader but she's always needed her own business.<br><br>my web page: at home std test ([http://www.blaze16.com/blog/255682 visit the up coming site]) |
| | |
| 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 graph|planar]]; a unit distance graph without crossings is called a '''[[matchstick graph]]'''.
| |
| | |
| 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. Another important open problem concerning unit distance graphs asks how many edges they can have relative to their number of [[vertex (graph theory)|vertices]].
| |
| | |
| ==Examples==
| |
| [[File:Hypercubestar.svg|thumb|150px|The [[hypercube graph]] ''Q''<sub>4</sub> as a unit distance graph.]]
| |
| The following graphs are unit distance graphs:
| |
| * Any [[cycle graph]]
| |
| * Any [[grid graph]]
| |
| * Any [[hypercube graph]]
| |
| * Any [[Star (graph theory)|star graph]]
| |
| * The [[Petersen graph]]
| |
| * The [[Heawood graph]] {{harv|Gerbracht|2009}}
| |
| * The [[wheel graph]] ''W''<sub>7</sub>
| |
| * The [[Moser spindle]], the smallest 4-chromatic unit distance graph
| |
| | |
| ==Subgraphs of unit distance graphs==
| |
| [[File:Möbius–Kantor unit distance.svg|thumb|150px|left|A unit distance drawing of the [[Möbius-Kantor graph]] in which some nonadjacent pairs are also at unit distance from each other.]]
| |
| Some sources define a graph as being a unit distance graph if its vertices can be mapped to distinct locations in the plane such that adjacent pairs are at unit distance apart, disregarding the possibility that some non-adjacent pairs might also be at unit distance apart. For instance, the [[Möbius-Kantor graph]] has a drawing of this type.
| |
| | |
| According to this looser definition of a unit distance graph, all [[generalized Petersen graph]]s are unit distance graphs {{harv|Žitnik|Horvat|Pisanski|2010}}. In order to distinguish the two definitions, the graphs in which non-edges are required to be a non-unit distance apart may be called '''strict unit distance graphs''' {{harv|Gervacio|Lim|Maehara|2008}}.
| |
| | |
| The graph formed by removing one of the spokes from the [[wheel graph]] ''W''<sub>7</sub> is a subgraph of a unit distance graph, but is not a strict unit distance graph: there is only one way ([[up to]] [[congruence (geometry)|congruence]]) to place the vertices at distinct locations such that adjacent vertices are a unit distance apart, and this placement also puts the two endpoints of the missing spoke at unit distance {{harv|Soifer|2008|p=94}}.
| |
| | |
| ==Counting unit distances==
| |
| {{unsolved|mathematics|How many unit distances can be determined by a set of ''n'' points?}}
| |
| | |
| {{harvs|authorlink=Paul Erdős|last=Erdős|first=Paul|txt|year=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 <math>n\log n.</math> By considering points in a square grid with carefully chosen spacing, Erdős found an improved lower bound of the form
| |
| | |
| :<math>n^{1+c/\log\log n},</math>
| |
| | |
| 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 {{harv|Kuperberg|1992}}. The best known upper bound for this problem, due to {{harvs|txt|author1-link=Joel Spencer|last1=Spencer|first1=Joel|author2-link=Endre Szemerédi|last2=Szemerédi|first2=Endre|last3=Trotter|first3=William|year=1984}}, is proportional to
| |
| | |
| :<math>n^{4/3};</math>
| |
| 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.
| |
| | |
| ==Representation of algebraic numbers and the Beckman–Quarles theorem==
| |
| For every [[algebraic number]] ''A'', it is possible to find a unit distance graph ''G'' in which some pair of vertices are at distance ''A'' in all unit distance representations of ''G'' {{harvs|last=Maehara|year=1991|year2=1992}}. This result implies a finite version of the [[Beckman–Quarles theorem]]: for any two points ''p'' and ''q'' at distance ''A'', there exists a finite [[Structural rigidity|rigid]] unit distance graph containing ''p'' and ''q'' such that any transformation of the plane that preserves the unit distances in this graph preserves the distance between ''p'' and ''q'' {{harv|Tyszka|2000}}. The full Beckman–Quarles theorem states that any transformation of the Euclidean plane (or a higher dimensional space) that preserves unit distances must be a [[isometry|congruence]]; that is, for the infinite unit distance graph whose vertices are all the points in the plane, any [[graph automorphism]] must be an [[isometry]] {{harv|Beckman|Quarles|1953}}.
| |
| | |
| ==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; {{harvtxt|Maehara|Rödl|1990}} show that the dimension necessary to embed a graph in this way may be bounded by twice its maximum degree.
| |
| | |
| The dimension needed to embed a graph so that all edges have unit distance, and the dimension needed to embed a graph so that the edges are exactly the unit distance pairs, may greatly differ from each other: the 2''n''-vertex [[crown graph]] may be embedded in four dimensions so that all its edges have unit length, but requires at least ''n'' − 2 dimensions to be embedded so that the edges are the only unit-distance pairs {{harv|Erdős|Simonovits|1980}}.
| |
| | |
| ==Computational complexity==
| |
| It is [[NP-hard]], and more specifically complete for the [[existential theory of the reals]], to test whether a given graph is a unit distance graph, or is a strict unit distance graph {{harv|Schaefer|2013}}.
| |
| | |
| ==See also==
| |
| *[[Unit disk graph]], a graph on the plane that has an edge whenever two points are at distance at most one
| |
| | |
| ==References==
| |
| *{{citation
| |
| | last1 = Beckman | first1 = F. S.
| |
| | last2 = Quarles | first2 = D. A., Jr.
| |
| | journal = Proceedings of the American Mathematical Society
| |
| | mr = 0058193
| |
| | pages = 810–815
| |
| | title = On isometries of Euclidean spaces
| |
| | volume = 4
| |
| | year = 1953}}.
| |
| *{{citation
| |
| | last = Erdős | first = Paul | author-link = Paul Erdős
| |
| | doi = 10.2307/2305092
| |
| | journal = [[American Mathematical Monthly]]
| |
| | pages = 248–250
| |
| | title = On sets of distances of ''n'' points
| |
| | volume = 53
| |
| | year = 1946
| |
| | issue = 5
| |
| | publisher = The American Mathematical Monthly, Vol. 53, No. 5
| |
| | jstor = 2305092}}.
| |
| *{{citation
| |
| | last1 = Erdős | first1 = Paul | author1-link = Paul Erdős
| |
| | last2 = Simonovits | first2 = Miklós
| |
| | journal = Ars Combinatoria
| |
| | pages = 229–246
| |
| | title = On the chromatic number of geometric graphs
| |
| | volume = 9
| |
| | year = 1980}}. As cited by {{harvtxt|Soifer|2008|p=97}}.
| |
| *{{citation
| |
| | last = Gerbracht | first = Eberhard H.-A.
| |
| | title = Eleven unit distance embeddings of the Heawood graph
| |
| | year = 2009
| |
| | arxiv = 0912.5395}}.
| |
| *{{citation
| |
| | last1 = Gervacio | first1 = Severino V.
| |
| | last2 = Lim | first2 = Yvette F.
| |
| | last3 = Maehara | first3 = Hiroshi
| |
| | doi = 10.1016/j.disc.2007.04.050
| |
| | issue = 10
| |
| | journal = Discrete Mathematics
| |
| | pages = 1973–1984
| |
| | title = Planar unit-distance graphs having planar unit-distance complement
| |
| | volume = 308
| |
| | year = 2008}}.
| |
| *{{citation
| |
| | last = Kuperberg | first = Greg | authorlink = Greg Kuperberg
| |
| | year = 1992
| |
| | title = The Erdos kitty: At least $9050 in prizes!
| |
| | series = Posting to usenet groups rec.puzzles and sci.math
| |
| | url = http://www.math.niu.edu/~rusin/known-math/93_back/prizes.erd}}.
| |
| *{{citation
| |
| | 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
| |
| | last = Maehara | first = Hiroshi}}.
| |
| *{{citation
| |
| | last = Maehara | first = Hiroshi
| |
| | doi = 10.1016/0012-365X(92)90671-2
| |
| | issue = 1-3
| |
| | journal = Discrete Mathematics
| |
| | mr = 1189840
| |
| | pages = 167–174
| |
| | title = Extending a flexible unit-bar framework to a rigid one
| |
| | volume = 108
| |
| | year = 1992}}.
| |
| *{{citation
| |
| | last1 = Maehara | first1 = Hiroshi | last2 = Rödl | first2 = 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}}.
| |
| *{{citation
| |
| | last = Schaefer | first = Marcus
| |
| | editor-last = Pach | editor-first = János | editor-link = János Pach
| |
| | contribution = Realizability of graphs and linkages
| |
| | doi = 10.1007/978-1-4614-0110-0_24
| |
| | pages = 461–482
| |
| | publisher = Springer
| |
| | title = Thirty Essays on Geometric Graph Theory
| |
| | year = 2013}}.
| |
| *{{citation
| |
| | last = Soifer | first = Alexander | authorlink = Alexander Soifer
| |
| | isbn = 978-0-387-74640-1
| |
| | publisher = Springer-Verlag
| |
| | title = The Mathematical Coloring Book
| |
| | year = 2008}}.
| |
| *{{citation
| |
| | author1-link=Joel Spencer|last1=Spencer|first1=Joel|author2-link=Endre Szemerédi|last2=Szemerédi|first2=Endre|last3=Trotter|first3=William T.
| |
| | contribution = Unit distances in the Euclidean plane
| |
| | title = Graph Theory and Combinatorics
| |
| | publisher = Academic Press
| |
| | year = 1984
| |
| | pages = 293–308}}.
| |
| *{{citation
| |
| | last = Tyszka | first = Apoloniusz
| |
| | doi = 10.1007/PL00000119
| |
| | issue = 1-2
| |
| | journal = Aequationes Mathematicae
| |
| | mr = 1741475
| |
| | pages = 124–133
| |
| | title = Discrete versions of the Beckman-Quarles theorem
| |
| | volume = 59
| |
| | year = 2000}}.
| |
| *{{citation
| |
| | last1 = Žitnik | first1 = Arjana
| |
| | last2 = Horvat | first2 = Boris
| |
| | last3 = Pisanski | first3 = Tomaž | author3-link = Tomaž Pisanski
| |
| | series = IMFM preprints
| |
| | title = All generalized Petersen graphs are unit-distance graphs
| |
| | url = http://www.imfm.si/preprinti/PDF/01109.pdf
| |
| | volume = 1109
| |
| | year = 2010}}.
| |
| | |
| == External links ==
| |
| *{{citation
| |
| | author = Venkatasubramanian, Suresh
| |
| | contribution = Problem 39: Distances among Point Sets in '''R'''<sup>2</sup> and '''R'''<sup>3</sup>
| |
| | title = The Open Problems Project
| |
| | url = http://maven.smith.edu/~orourke/TOPP/P39.html}}.
| |
| *{{mathworld|urlname=Unit-DistanceGraph|title=Unit-Distance Graph}}
| |
| | |
| [[Category:Geometric graphs]]
| |