On the tree packing conjectureReportar como inadecuado



 On the tree packing conjecture


On the tree packing conjecture - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Descargar gratis o leer online en formato PDF el libro: On the tree packing conjecture
The Gy\arf\as tree packing conjecture states that any set of $n-1$ trees $T {1},T {2},

., T {n-1}$ such that $T i$ has $n-i+1$ vertices pack into $K n$. We show that $t=1-10n^{1-4}$ trees $T 1,T 2,

., T t$ such that $T i$ has $n-i+1$ vertices pack into $K {n+1}$ for $n$ large enough. We also prove that any set of $t=1-10n^{1-4}$ trees $T 1,T 2,

., T t$ such that no tree is a star and $T i$ has $n-i+1$ vertices pack into $K {n}$ for $n$ large enough. Finally, we prove that $t=1-4n^{1-3}$ trees $T 1,T 2,

., T t$ such that $T i$ has $n-i+1$ vertices pack into $K n$ as long as each tree has maximum degree at least $2n^{2-3}$ for $n$ large enough. One of the main tools used in the paper is the famous spanning tree embedding theorem of Koml\os, S\ark\-ozy and Szemer\edi.



Autor: József Balogh; Cory Palmer

Fuente: https://archive.org/



DESCARGAR PDF




Documentos relacionados