Tree packing conjecture for bounded degree trees

Jaehoon Kim (김재훈)

School of Mathematics, Birmingham University, UK

School of Mathematics, Birmingham University, UK

2016/12/28 Wed 4PM-5PM

We prove that if T

We deduce this result from a more general theorem, which yields decompositions of dense quasi-random graphs into suitable families of bounded degree graphs.

In this talk, we discuss the ideas used in the proof.

This is joint work with Felix Joos, Daniela Kühn and Deryk Osthus.

_{1},…, T_{n}is a sequence of bounded degree trees so that T_{i}has i vertices, then K_{n}has a decomposition into T_{1},…, T_{n}. This shows that the tree packing conjecture of Gyárfás and Lehel from 1976 holds for all bounded degree trees.We deduce this result from a more general theorem, which yields decompositions of dense quasi-random graphs into suitable families of bounded degree graphs.

In this talk, we discuss the ideas used in the proof.

This is joint work with Felix Joos, Daniela Kühn and Deryk Osthus.

Tags: 김재훈