Some Sharp Concentration Results about Random Planar Triangulations

The theory of random maps has a relatively short history compared with the theory of random graphs. In this talk, we mention some recent sharp concentration results about random planar triangulations such as the maximum vertex degree, the largest component, the number of copies of a given submap, and the number of flippable edges.