Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, September 24, 2015, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Frank Mousset

A sequence G_{1},...,G_{t} of graphs is said to *pack* into a graph G if G contains G_{1},...,G_{t} as edge-disjoint subgraphs. I will talk about the following result. Let F be a non-trivial minor-closed family of graphs (for example, the family of planar graphs). Then for all positive constants x and D and for every sufficiently large integer n, every sequence G_{1},...,G_{t} of graphs in F such that

- v(G_{i}) ≤ n for all i,

- e(G_{1}) + ... + e(G_{t}) ≤ (1-x) n(n-1)/2, and

- the maximum degree of each G_{i} is at most D,

packs into the complete graph on n vertices. This improves a very similar result of Messuti, Rödl, and Schacht in which the graphs are required to have at most (1-x)n vertices.

Joint work with Asaf Ferber and Choongbum Lee.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login