An approximate version of the tree packing conjecture via random embeddings

DOI10.4230/LIPICS.APPROX-RANDOM.2014.490zbMATH Open1359.05108OpenAlexW2241615493MaRDI QIDQ2969640FDOQ2969640

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

Publication date: 22 March 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490

Recommendations

• An approximate version of the tree packing conjecture
• On the tree packing conjecture
• Packing trees of unbounded degrees in random graphs
• Optimal packings of bounded degree trees
• Packing trees of bounded diameter into the complete graph

zbMATH Keywords

random walksquasirandom graphsRingel conjecturetree packing conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)

Cited In (2)

• An approximate version of the tree packing conjecture
• Packing tree factors in random and pseudo-random graphs

This page was built for publication: An approximate version of the tree packing conjecture via random embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969640)