Packing minor-closed families of graphs into complete graphs

DOI10.1016/j.jctb.2016.03.003zbMath1334.05121arXiv1602.06780OpenAlexW2282871663MaRDI QIDQ273186

Silvia Messuti, Mathias Schacht, Vojtěch Rödl

Publication date: 21 April 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

packingsminor-closed families

Mathematics Subject Classification ID

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

Related Items

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Packing spanning graphs from separable families ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Packing degenerate graphs greedily ⋮ 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 ⋮ 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

• An approximate version of the tree packing conjecture
• Asymptotic behavior of the chromatic index for hypergraphs
• Near perfect coverings in graphs and hypergraphs
• Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
• A Separator Theorem for Nonplanar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item