Lesson plan
Uniform tree
In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and G/X is finite. Also equivalent is the existence of a uniform X-lattice in G . For a graph G which contains no cycles, G is its own uniform tree. If G contains at least 1 cycle, its uniform tree is an infinite tree. Leighton's Graph Covering Theorem states that any two finite graphs that share a common covering must also share a common finite covering. Walter D. Neumann expanded on this in 2011, proving any two graphs that have a common covering necessarily have the same universal covering. This means that every uniform tree corresponds to a unique family of finite graphs.
Article summary
In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and G/X is finite. Also equivalent is the existence of a uniform X-lattice in G . For a graph G which contains no cycles, G is its own uniform tree. If G contains at least 1 cycle, its uniform tree is an infinite tree. Leighton's Graph Covering Theorem states that any two finite graphs that share a common covering must also share a common finite covering. Walter D. Neumann expanded on this in 2011, proving any two graphs that have a common covering necessarily have the same universal covering. This means that every uniform tree corresponds to a unique family of finite graphs.
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.