Uniform tree

In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

See also

Covering graph

Text derived from https://en.wikipedia.org/w/index.php?oldid=1317749502 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.