Packing degenerate graphs

DOI10.1016/j.aim.2019.106739zbMath1419.05172arXiv1711.04869OpenAlexW2768943886MaRDI QIDQ2324574

Yanyan Li

Publication date: 11 September 2019

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph packingrandomised algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (12)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ The generalised Oberwolfach problem ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ 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 rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ A proof of Ringel's conjecture ⋮ Resolution of the Oberwolfach problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of the tree packing conjecture
• Packing minor-closed families of graphs into complete graphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• On tail probabilities for martingales
• Some remarks on packing trees
• Optimal packings of bounded degree trees
• On the decomposition threshold of a given graph
• Fractional clique decompositions of dense graphs and hypergraphs
• Packing spanning graphs from separable families
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• A blow-up lemma for approximate decompositions
• Packing trees of unbounded degrees in random graphs
• Almost all trees are almost graceful
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• On the Tree Packing Conjecture
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Quasi-random graphs

This page was built for publication: Packing degenerate graphs