When: Sunday, November 27, 10am
Where: Schreiber 309
Speaker: Jan Hladky, Czech Academy of Sciences
Title: Cliques in dense inhomogeneous random graphs
Dense inhomogeneous random graph G(n,W) generalize the classical
Erdos-Renyi model G(n,p). These random graphs are key objects in
the theory of limits of dense graph sequences. For a wide class
of graphons W, we determine the typical clique number of G(n,W).
This is joint work with Martin Dolezal and Andras Mathe.
I will also talk about the related problem of the chromatic
number of G(n,W).