# 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 2.9.2016 at 12:20 in S6, there is the following noon lecture:

# Decomposing random d-regular graphs into stars

## Bernard Lidicky

## Abstract

(joint work with Delcourt and Postle)

In 2006 Barat and Thomassen conjectured that every planar 4-regular 4-edge-connected graph has an edge decomposition into claws; shortly after, Lai constructed a counterexample. Recently, Delcourt and Postle showed that a random 4-regular graph has an edge decomposition into claws a.a.s.. We generalize the result to decomposition of d-regular graphs into stars for some other values of d. We use the small subgraph conditioning method of Robinson and Wormald.

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