Packing Trees into the Complete Graph

DOI10.1017/S0963548301005077zbMATH Open1032.05112OpenAlexW2102791155MaRDI QIDQ3147238FDOQ3147238

Authors: Edward Dobson 

Publication date: 18 September 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548301005077

Recommendations

• Packing trees in complete graphs
• On packing trees into complete bipartite graphs
• Packing trees of bounded diameter into the complete graph
• Packing almost stars into the complete graph
• scientific article; zbMATH DE number 4145943

Mathematics Subject Classification ID

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

Cited In (14)

• Packing trees of unbounded degrees in random graphs
• Packing spanning graphs from separable families
• An approximate version of the tree packing conjecture
• Packing trees of bounded diameter into the complete graph
• Title not available (Why is that?)
• Packing trees in complete graphs
• A blow-up lemma for approximate decompositions
• Title not available (Why is that?)
• Asymptotically optimal tree-packings in regular graphs
• Optimal packings of bounded degree trees
• A note on packing two copies of a tree into a graph with small maximum degree
• Packing three copies of a tree into a complete bipartite graph
• Packing four copies of a tree into a complete bipartite graph
• Almost regular edge colorings and regular decompositions of complete graphs

This page was built for publication: Packing Trees into the Complete Graph

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