by Louis Esperet
Abstract:
I will talk about asymptotic dimension, which is a large-scale metric invariant introduced by Gromov in 1993. When specialized to graphs, this notion has interesting connections with several other well-studied notions in graph theory and theoretical computer science (clustered coloring, weak-diameter network decompositions). We proved that planar graphs (and more generally graphs embeddable on any fixed surface) have asymptotic dimension 2. We also proved that bounded degree graphs avoiding a fixed minor also have asymptotic dimension at most 2 (this solved an open problem in geometric group theory). Many interesting questions and problems remain open !
Joint work with M. Bonamy, N. Bousquet, C. Groenland, F. Pirot, and A. Scott.
Event Timeslots (1)
Friday
-
Louis Esperet