Date
Wed, 29 May 2019
16:00
Location
C1
Speaker
Sam Shepherd
Organisation
Oxford University

Leighton's Theorem states that if two finite graphs have a common universal cover then they have a common finite cover. I will present a new proof of this using groupoids, and then talk about two generalisations of the theorem that can also be tackled with this groupoid approach: one gives us control over the local structure of the common finite cover, and the other deals with graphs of spaces.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 15:24.