Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:An approximate version of the tree packing conjecture
Speaker:Jan Hladky
coming from:University of Warwick
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 21 August 2014
Duration:30 Minutes
Building:E1 4
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 Gyárfás 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 Böttcher, Diana Piguet, and Anusch Taraz.

Name(s):Anna Adamaszek
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Anna Adamaszek, 08/16/2014 09:01 PM -- Created document.