Two generalisations of Leighton's Theorem

Sam Shepherd, Giles Gardam, Daniel J. Woodhouse

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a mode…