The talk will outline a combinatorial proof that the maximum height of Galton-Watson trees with n vertices converges in distribution, as n tends to infinity and with the proper scaling, to the maximum of a Brownian excursion of duration 1. The proof is due to Flajolet and Odlyzko and makes heavy use of complex analysis to analyze the generating functions that describe the profile of Galton-Watson...