Revisiting Leighton's theorem with the Haar measure
Leighton’s graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton’s theorem that allows generalisations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidi...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Cambridge University Press
2020
|