Optimal packings of bounded degree trees
From MaRDI portal
Publication:2279501
DOI10.4171/JEMS/909zbMath1429.05164arXiv1606.03953OpenAlexW2964207094MaRDI QIDQ2279501
Jae-Hoon Kim, Deryk Osthus, Felix Joos, Daniela Kühn
Publication date: 12 December 2019
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03953
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (21)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Packing degenerate graphs greedily ⋮ Finding large rainbow trees in colourings of \(K_{n, n}\) ⋮ 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 ⋮ Minimalist designs ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Almost all trees are almost graceful ⋮ A rainbow blow‐up lemma ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A proof of Ringel's conjecture ⋮ Resolution of the Oberwolfach problem ⋮ Packing trees of unbounded degrees in random graphs ⋮ Pseudorandom hypergraph matchings ⋮ Packing degenerate graphs ⋮ Unnamed Item
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
- Packing tree factors in random and pseudo-random graphs
- Hamiltonian degree sequences in digraphs
- Packing trees in complete graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- New families of graphs that have \(\alpha\)-labelings
- Blow-up lemma
- A dynamic survey of graph labeling
- Packing and decomposition of graphs with trees
- Balanced integer arrays: a matrix packing theorem
- Some remarks on packing trees
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- On the decomposition threshold of a given graph
- Packing large trees of consecutive orders
- Hamilton decompositions of regular expanders: applications
- Weighted sums of certain dependent random variables
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Concentration of the hypergeometric distribution
- Packing spanning graphs from separable families
- Packing Trees into the Complete Graph
- A blow-up lemma for approximate decompositions
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- A bandwidth theorem for approximate decompositions
- Packing trees of unbounded degrees in random graphs
- Almost all trees are almost graceful
- Edge-disjoint Hamilton cycles in random graphs
- Probability Inequalities for Sums of Bounded Random Variables
- On the Tree Packing Conjecture
- Almost Every Tree With m Edges Decomposes K2m,2m
- Optimal path and cycle decompositions of dense quasirandom graphs
- Probability theory. A comprehensive course
- Decomposing almost complete graphs by random trees
This page was built for publication: Optimal packings of bounded degree trees
