Extreme local statistics in random graphs: maximum tree extension counts

Pedro Araújo, Simon Griffiths, Matas Šileikis +1

We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at ver…