Daniel Woodhouse (Technion)

Title:Revisiting Leighton's graph covering theorem

Leighton's graph covering theorem states that two finite graphs with isomorphic universal covers have isomorphic finite covers. I will discuss a new proof that involves using the Haar measure to solve a set of gluing equations. I will discuss generalizations to graphs with fins, and applications to quasi-isometric rigidity.