Publisher DOI: 10.1007/s11856-015-1277-2
Title: An approximate version of the tree packing conjecture
Language: English
Authors: Böttcher, Julia 
Hladký, Jan 
Piguet, Diana 
Taraz, Anusch 
Issue Date: 1-Feb-2016
Source: Israel Journal of Mathematics 1 (211): 391-446 (2016-02-01)
Abstract (english): 
We prove that for any pair of constants ɛ > 0 and Δ and for n sufficiently large, every family of trees of orders at most n, maximum degrees at most Δ, and with at most (n2) edges in total packs into (Formula presented.). This implies asymptotic versions of the Tree Packing Conjecture of Gyárfás from 1976 and a tree packing conjecture of Ringel from 1963 for trees with bounded maximum degree. A novel random tree embedding process combined with the nibble method forms the core of the proof.
URI: http://hdl.handle.net/11420/5974
ISSN: 0021-2172
Journal: Israel journal of mathematics 
Institute: Mathematik E-10 
Document Type: Article
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

68
Last Week
1
Last month
2
checked on Jul 5, 2022

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
checked on Jun 30, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.