Date
Wed, 06 May 2020
10:00
Location
Virtual
Speaker
Daniel Woodhouse
Organisation
University of Oxford

Let X_1 and X_2 be finite graphs with isomorphic universal covers.

Leighton's graph covering theorem states that X_1 and X_2 have a common finite cover.

I will discuss recent work generalizing this theorem and how myself and Sam Shepherd have been applying it to rigidity questions in geometric group theory.

Last updated on 6 May 2025, 2:04pm. Please contact us with feedback and comments about this page.