Title    name
2016 Discrete Math 세미나
  Speaker 김재훈
  Date 2016-12-28
  Place KAIST
  File  의 1 번째 Real Media 동영상입니다. 의 1 번째 강연자료입니다.
Abstract : We prove that if T1,…, Tn is a sequence of bounded degree trees so that Ti has i vertices, then Kn has a decomposition into T1,…, Tn. 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.