King's College London

We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) A_n. We show that with high probability L(n) ≤ ne ^{−logc n for any constant c < 2/3.}