On 5.11.2015 at 12:20 in S6, there is the following noon lecture:
Cliques in dense inhomogeneous random graphs
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.
Webmaster: kamweb.mff.cuni.cz Archive page