Jump to content

Uniform tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 18:14, 14 July 2016 (stub sorting — {{combin-stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Sources

  • Bass, Hyman; Lubotzky, Alexander (2001), Tree Lattices, Progress in Mathematics, vol. 176, Birkhäuser, ISBN 0-8176-4120-3
Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Uniform_tree&oldid=729809679"