# Noon lecture

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

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

# Concentration of extension counts in random graphs

## Matas Šileikis

## Abstract

A graph is epsilon-regular when the ratio of its maximum and minimum vertex degrees is at most 1 + epsilon. Given a fixed graph H, one can generalize the notion of regularity by replacing a vertex degree deg(v) by the number of copies of H containing vertex v (the vertex degrees correspond to the case H = K_2). In late 1980s Joel Spencer gave sufficient conditions for the random graph G(n,p) being epsilon-regular with respect to general H. I will present joint work with Lutz Warnke in which we study the sharpness of Spencer's results and refine them.

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

Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010