Lesson plan
Dimension (graph theory)
is 2. In mathematics, and particularly in graph theory, the dimension of a graph is the least integer such that there exists a "classical representation" of the graph in the Euclidean space of dimension with all the edges having unit length. In a classical representation, the vertices must be distinct points, but the edges may cross one another. The dimension of a graph is written \dim G . For example, the Petersen graph can be drawn with unit edges in E^2 , but not in E^1 : its dimension is therefore 2 (see the figure to the right). This concept was introduced in 1965 by Paul Erdős, Frank Harary and William Tutte. It generalises the concept of unit distance graph to more than 2 dimensions.
Article summary
is 2. In mathematics, and particularly in graph theory, the dimension of a graph is the least integer such that there exists a "classical representation" of the graph in the Euclidean space of dimension with all the edges having unit length. In a classical representation, the vertices must be distinct points, but the edges may cross one another. The dimension of a graph is written \dim G . For example, the Petersen graph can be drawn with unit edges in E^2 , but not in E^1 : its dimension is therefore 2 (see the figure to the right). This concept was introduced in 1965 by Paul Erdős, Frank Harary and William Tutte. It generalises the concept of unit distance graph to more than 2 dimensions.
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.