A Short proof of the blow-up lemma for approximate decompositions
From MaRDI portal
Publication:2678455
DOI10.1007/s00493-020-4640-9OpenAlexW2999207003WikidataQ113904982 ScholiaQ113904982MaRDI QIDQ2678455
Publication date: 23 January 2023
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03506
Related Items (1)
Cites Work
- Unnamed Item
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Blow-up lemma
- Counting designs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Resolution of the Oberwolfach problem
- 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
- 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
- Packing spanning graphs from separable families
- The generalised Oberwolfach problem
- A hypergraph blow-up lemma
- 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
- Pseudorandom hypergraph matchings
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Tree decompositions of graphs without large bipartite holes
- A rainbow blow‐up lemma
- Rainbow structures in locally bounded colorings of graphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Decomposing Graphs into Edges and Triangles
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Perfectly packing graphs with bounded degeneracy and many leaves
This page was built for publication: A Short proof of the blow-up lemma for approximate decompositions
