The Blow-up Lemma

DOI10.1017/S0963548398003502zbMath0927.05041OpenAlexW2166751465WikidataQ124977476 ScholiaQ124977476MaRDI QIDQ4243077

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

zbMATH Keywords

embeddingregularity lemmadense graphsblow-up lemmalarge sparse graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (23)

Packing tripods: narrowing the density gap ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ The minimum degree threshold for perfect graph packings ⋮ Stability for vertex cycle covers ⋮ Embedding spanning subgraphs of small bandwidth ⋮ Hamiltonian cycles with all small even chords ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Perfect packings with complete graphs minus an edge ⋮ On embedding well-separable graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ On the relation of separability, bandwidth and embedding ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Bandwidth theorem for random graphs ⋮ Large planar subgraphs in dense graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Almost-spanning subgraphs with bounded degree in dense graphs

This page was built for publication: The Blow-up Lemma