Groups, Geometry, and Dynamics


Full-Text PDF (148 KB) | Metadata | Table of Contents | GGD summary
Volume 4, Issue 4, 2010, pp. 863–872
DOI: 10.4171/GGD/111

Published online: 2010-10-15

On Leighton’s graph covering theorem

Walter D. Neumann[1]

(1) Barnard College, Columbia University, New York, USA

We give short expositions of both Leighton’s proof and the Bass–Kulkarni proof of Leighton’s graph covering theorem, in the context of colored graphs. We discuss a further generalization, needed elsewhere, to “symmetry-restricted graphs”. We can prove it in some cases, for example, if the “graph of colors” is a tree, but we do not know if it is true in general. We show that Bass’s Conjugation Theorem, which is a tool in the Bass–Kulkarni approach, does hold in the symmetry-restricted context.

Keywords: Leighton’s theorem, graph covering, tree lattice

Neumann Walter: On Leighton’s graph covering theorem. Groups Geom. Dyn. 4 (2010), 863-872. doi: 10.4171/GGD/111