Long paths in random Apollonian networks

We consider the length $L(n)$ of the longest path in a randomly generated Apollonian Network (ApN) ${\mathcal{A}}_n$. We show that w.h.p. $L(n)\leq ne^{-\log^cn}$foranyconstant$c<2/3$.