On the tree depth of random graphs

The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expansion classes and has been introduced under numerous names. We describe the asymptotic behaviour of this parameter in the case of dense and of sparse random graphs. The results also provide analogous descriptions for the tree-width of random graphs