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
University of Birmingham
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, Jan Hladký, and Anusch Taraz.
Webmaster: kamweb.mff.cuni.cz Modified: 25. 02. 2019