Packing degenerate graphs greedily

DOI10.1016/J.ENDM.2017.06.019zbMath1378.05157OpenAlexW2743639264MaRDI QIDQ1689877

Peng Zhang

Publication date: 18 January 2018

Full work available at URL: http://eprints.lse.ac.uk/84158/1/Packing%20degenerate%20graphs%20greedily_Final.pdf

zbMATH Keywords

graph packinggraph processestree packing conjecture

Mathematics Subject Classification ID

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

Cites Work

• An approximate version of the tree packing conjecture
• Packing minor-closed families of graphs into complete graphs
• Optimal packings of bounded degree trees
• Packing spanning graphs from separable families
• A blow-up lemma for approximate decompositions
• Packing trees of unbounded degrees in random graphs

This page was built for publication: Packing degenerate graphs greedily