Packing trees of unbounded degrees in random graphs
From MaRDI portal
Publication:4967960
DOI10.1112/jlms.12179zbMath1415.05147arXiv1607.07342OpenAlexW2507485825MaRDI QIDQ4967960
Publication date: 11 July 2019
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.07342
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (10)
A Short proof of the blow-up lemma for approximate decompositions ⋮ Packing degenerate graphs greedily ⋮ 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 ⋮ Almost all trees are almost graceful ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ A proof of Ringel's conjecture ⋮ Optimal packings of bounded degree trees ⋮ Packing degenerate graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- Packing trees in complete graphs
- Some remarks on packing trees
- Optimal packings of bounded degree trees
- Robust Hamiltonicity of random directed graphs
- Packing spanning graphs from separable families
- Embedding Spanning Trees in Random Graphs
- Packing Trees into the Complete Graph
- Probability Inequalities for the Sum of Independent Random Variables
- Local resilience of graphs
- Packing almost stars into the complete graph
- A blow-up lemma for approximate decompositions
- Packing perfect matchings in random hypergraphs
- On the Tree Packing Conjecture
This page was built for publication: Packing trees of unbounded degrees in random graphs