Lesson plan
Unit distance graph
In mathematics, 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 whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs. A problem posed by Paul Erdős known as the unit distance problem asks for the maximum possible number of unit-distance pairs determined by n points in the Euclidean plane; equivalently, it asks for the maximum number of edges in a unit distance graph on n vertices. The best known upper bound is O(n^{4/3}). The best known lower bound is \Omega(n^{1.014}) (for sufficiently large n) . The number of colors required to color T unit distance graphs is also unknown; in the equivalent Hadwiger–Nelson problem for the plane, some unit distance graphs require five colors, and every unit distance graph can be colored with seven colors.…
Article summary
In mathematics, 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 whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs. A problem posed by Paul Erdős known as the unit distance problem asks for the maximum possible number of unit-distance pairs determined by n points in the Euclidean plane; equivalently, it asks for the maximum number of edges in a unit distance graph on n vertices. The best known upper bound is O(n^{4/3}). The best known lower bound is \Omega(n^{1.014}) (for sufficiently large n) . The number of colors required to color T unit distance graphs is also unknown; in the equivalent Hadwiger–Nelson problem for the plane, some unit distance graphs require five colors, and every unit distance graph can be colored with seven colors.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.