The Blow-up Lemma
From MaRDI portal
Publication:4243077
DOI10.1017/S0963548398003502zbMATH Open0927.05041OpenAlexW2166751465WikidataQ124977476 ScholiaQ124977476MaRDI QIDQ4243077FDOQ4243077
Authors: János Komlós 
Publication date: 5 December 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003502
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (33)
- Almost-spanning subgraphs with bounded degree in dense graphs
- Hamiltonian cycles with all small even chords
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Triangle packings and 1-factors in oriented graphs
- Spanning embeddings of arrangeable graphs with sublinear bandwidth
- Packing tripods: narrowing the density gap
- The sparse regularity lemma and its applications
- A blow-up lemma for approximate decompositions
- Embedding spanning bipartite graphs of small bandwidth
- An extension of the blow-up lemma to arrangeable graphs
- Embedding spanning subgraphs of small bandwidth
- Bandwidth theorem for random graphs
- The minimum degree threshold for perfect graph packings
- The bandwidth theorem for locally dense graphs
- Spanning trees in graphs without large bipartite holes
- Spanning subdivisions in Dirac graphs
- Large planar subgraphs in dense graphs
- The Levi problem in the blow-up
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- On the relation of separability, bandwidth and embedding
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- Hypergraph Packing and Graph Embedding
- On the KŁR conjecture in random graphs
- Embedding large subgraphs into dense graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Stability for vertex cycle covers
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An algorithmic version of the blow-up lemma
- A hypergraph blow-up lemma
- Bandwidth, treewidth, separators, expansion, and universality
- On embedding well-separable graphs
- Perfect packings with complete graphs minus an edge
This page was built for publication: The Blow-up Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243077)
