Document Open Access Logo

An Approximate Version of the Tree Packing Conjecture via Random Embeddings

Authors Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2014.490.pdf
  • Filesize: 476 kB
  • 10 pages

Document Identifiers

Author Details

Julia Böttcher
Jan Hladký
Diana Piguet
Anusch Taraz

Cite AsGet BibTex

Julia Böttcher, Jan Hladký, Diana Piguet, and Anusch Taraz. An Approximate Version of the Tree Packing Conjecture via Random Embeddings. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 490-499, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490

Abstract

We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of trees of orders at most n, maximum degrees at most D, and with at most n(n-1)/2 edges in total packs into the complete graph of order (1+a)n. This implies asymptotic versions of the Tree Packing Conjecture of Gyarfas 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.
Keywords
  • tree packing conjecture
  • Ringel’s conjecture
  • random walks
  • quasirandom graphs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail