Cliques in dense inhomogeneous random graphs

Martin Doležal

Abstract

The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant of the Erdos-Rényi random graph. We study the clique number of these random graphs. For a large class of graphons, we establish a formula which gives the almost sure clique number of these random graphs.