Abstract:
The goal of this talk is to show how the asymptotic behavior of the number of cut-vertices in random planar maps can be determined.
Interestingly the combinatorics behind this problem is quite involved.
This is joint work with Marc Noy and Benedikt Stufler.