Noon lecture

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

On 30.05.2014 at 10:00 in S5, there is the following noon lecture:

An approximate version of the tree packing conjecture for bounded degree

Diana Piguet

University of Birmingham

Abstract

A family of graphs packs into a graph G if there exist pairwise edge-disjoint copies of its members in G. We prove a theorem about packing trees into a complete graph. The result implies asymptotic versions of the Tree Packing Conjecture of Gyrfs and of the Ringel Conjecture for the class of trees with bounded maximal degree. The core of the proof is a random process controlled by the nibbling method.

This is a joint work with Julia Bttcher, Jan Hladk, and Anusch Taraz.

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