An approximate version of the tree packing conjecture

DOI10.1007/s11856-015-1277-2zbMath1334.05111arXiv1404.0697OpenAlexW1855902937WikidataQ123122217 ScholiaQ123122217MaRDI QIDQ273108

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

Publication date: 21 April 2016

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.0697

zbMATH Keywords

nibble methodrandom tree embedding process

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (19)

Packing minor-closed families of graphs into complete graphs ⋮ Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Packing spanning graphs from separable families ⋮ Packing large trees of consecutive orders ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Packing degenerate graphs greedily ⋮ Problems close to my heart ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ Graph and hypergraph packing ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Almost all trees are almost graceful ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ A proof of Ringel's conjecture ⋮ Decomposing almost complete graphs by random trees ⋮ Optimal packings of bounded degree trees ⋮ Packing trees of unbounded degrees in random graphs ⋮ Packing degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing minor closed families of graphs
• Random walks on quasirandom graphs
• Packing tree factors in random and pseudo-random graphs
• A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
• The triangle-free process
• On a packing and covering problem
• Packing trees in complete graphs
• Packings of graphs and applications to computational complexity
• On packing trees into complete bipartite graphs
• Packing graphs: The packing problem solved
• Balanced integer arrays: a matrix packing theorem
• Some remarks on packing trees
• Subgraphs of graphs. I
• Packing Trees into the Complete Graph
• Concentration for self-bounding functions and an inequality of Talagrand
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the Tree Packing Conjecture
• Quasi-random graphs

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