# Noon lecture

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

On 5.11.2015 at 12:20 in S6, there is the following noon lecture:

# 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.

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

Webmaster: kamweb.mff.cuni.cz Archive page