Large cliques in a power-law random graph

Svante Janson, Tomasz Łuczak, Ilkka Norros

We study the size of the largest clique $\omega (G(n,\alpha ))$ in a random graph $G(n,\alpha )$ on $n$ vertices which has power-law degree distribution with exponent $\alpha$. We show that for `flat' de…