Existence of Tree Lattices
- 344 Downloads
Let X be a locally finite tree, and G = Aut(X). When does X admit a—uniform, or non-uniform—lattice? We would like to answer this in terms of properties of the edge-indexed quotient graph I (G\\X) (cf. (2.4) and (2.5)).
KeywordsFundamental Group Finite Type Tree Lattice Connected Subgraph Covering Graph
Unable to display preview. Download preview PDF.