Blow-up lemma
From MaRDI portal
Publication:1375060
DOI10.1007/BF01196135zbMath0880.05049OpenAlexW2054249991WikidataQ56675392 ScholiaQ56675392MaRDI QIDQ1375060
Endre Szemerédi, János Komlós, Gábor N. Sárközy
Publication date: 5 January 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01196135
Related Items
An Asymptotic Multipartite Kühn--Osthus Theorem, Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree, A spanning bandwidth theorem in random graphs, Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Minimum Degrees for Powers of Paths and Cycles, On characterizing hypergraph regularity, Embedding clique-factors in graphs with low \(\ell\)-independence number, Graph Tilings in Incompatibility Systems, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, On sufficient conditions for spanning structures in dense graphs, The Ramsey numbers of squares of paths and cycles, Minimum degree conditions for tight Hamilton cycles, F$F$‐factors in Quasi‐random Hypergraphs, Blowup polynomials and delta-matroids of graphs, Graph and hypergraph packing, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, Perfect Packings in Quasirandom Hypergraphs II, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Boolean graphs are Cohen–Macaulay, A rainbow blow‐up lemma, A Rainbow Dirac's Theorem, Local colourings and monochromatic partitions in complete bipartite graphs, A rainbow blow-up lemma for almost optimally bounded edge-colourings, The bandwidth theorem for locally dense graphs, Pósa's conjecture for graphs of order at least 2 × 108, A blow-up lemma for approximate decompositions, Embedding Spanning Bipartite Graphs of Small Bandwidth, Implements of Graph Blow-Up in Co-Maximal Ideal Graphs, An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs, Graph properties of co-maximal ideal graphs of commutative rings, On the Bollobás–Eldridge Conjecture for Bipartite Graphs, Proof of a tiling conjecture of Komlós, Dirac's Condition for Spanning Halin Subgraphs, Pseudorandom hypergraph matchings, A discrepancy version of the Hajnal–Szemerédi theorem, A geometric theory for hypergraph matching, Ramsey Numbers Involving Large Books, An Extension of the Blow-up Lemma to Arrangeable Graphs, Extremal functions for sparse minors, Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles, The Monochromatic Circumference of 2‐Edge‐Colored Graphs, Ramsey numbers of fans and large books, Corrádi and Hajnal's Theorem for Sparse Random Graphs, Perfect packings in quasirandom hypergraphs. I., Graphs with induced-saturation number zero, Minimum degree thresholds for bipartite graph tiling, Tilings in vertex ordered graphs, Note on semi-linkage with almost prescribed lengths in large graphs, Ramsey numbers of a fixed odd-cycle and generalized books and fans, Monochromatic cycle power partitions, Triangle-Tilings in Graphs Without Large Independent Sets, A new view toward vertex decomposable graphs, On a degree sequence analogue of Pósa's conjecture, Counting in hypergraphs via regularity inheritance, Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles, The minimum degree threshold for perfect graph packings, Distributing pairs of vertices on Hamiltonian cycles, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, An improved bound for the monochromatic cycle partition number, Powers of Hamilton cycles of high discrepancy are unavoidable, An Ore-type theorem on Hamiltonian square cycles, Stability for vertex cycle covers, Asymptotic multipartite version of the Alon-Yuster theorem, The generalised Oberwolfach problem, Local resilience for squares of almost spanning cycles in sparse random graphs, Improved monochromatic loose cycle partitions in hypergraphs, Maximum planar subgraphs in dense graphs, Global maker-breaker games on sparse graphs, A Short proof of the blow-up lemma for approximate decompositions, Embedding spanning subgraphs of small bandwidth, Proof of Komlós's conjecture on Hamiltonian subsets, Hamiltonian cycles with all small even chords, Approximate multipartite version of the Hajnal-Szemerédi theorem, Bounded-Degree Spanning Trees in Randomly Perturbed Graphs, The extremal function for partial bipartite tilings, A degree sequence version of the Kühn-Osthus tiling theorem, On multipartite Hajnal-Szemerédi theorems, Sparse partition universal graphs for graphs of bounded degree, Tiling multipartite hypergraphs in quasi-random hypergraphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles, A Dirac-Type Result on Hamilton Cycles in Oriented Graphs, Combinatorial and computational aspects of graph packing and graph decomposition, On a tiling conjecture of Komlós for 3-chromatic graphs., Hamilton cycles in dense vertex-transitive graphs, Minimum degree conditions for monochromatic cycle partitioning, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Degree sum and graph linkage with prescribed path lengths, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Note on Enomoto and Ota's conjecture for short paths in large graphs, Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\), On embedding well-separable graphs, Quadripartite version of the Hajnal-Szemerédi theorem, Directed Graphs Without Short Cycles, Monochromatic bounded degree subgraph partitions, Powers of Hamilton cycles in pseudorandom graphs, On 2-factors with \(k\) components, On vertex-disjoint paths in regular graphs, Proof of the bandwidth conjecture of Bollobás and Komlós, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Enomoto and Ota's conjecture holds for large graphs, How to avoid using the regularity Lemma: Pósa's conjecture revisited, A fast algorithm for equitable coloring, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Ramsey-goodness -- and otherwise, Placing specified vertices at precise locations on a Hamiltonian cycle, Short paths in quasi-random triple systems with sparse underlying graphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Matching polytons, Optimal packings of bounded degree trees, Spanning embeddings of arrangeable graphs with sublinear bandwidth, Near-perfect clique-factors in sparse pseudorandom graphs, Distributing vertices along a Hamiltonian cycle in Dirac graphs, On the relation of separability, bandwidth and embedding, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Resolution of the Oberwolfach problem, Star-critical Ramsey numbers for large generalized fans and books, Rainbow factors in hypergraphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, Matchings with few colors in colored complete graphs and hypergraphs, Proof of the Seymour conjecture for large graphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Ramsey Number of a Connected Triangle Matching, A hypergraph blow-up lemma, Triangle packings and 1-factors in oriented graphs, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Monochromatic square-cycle and square-path partitions, Bandwidth theorem for random graphs, Vertex partitions by connected monochromatic \(k\)-regular graphs, Powers of Hamiltonian cycles in multipartite graphs, Clique-factors in sparse pseudorandom graphs, Locating any two vertices on Hamiltonian cycles in large graphs, Threshold Ramsey multiplicity for paths and even cycles, Cycle factors in dense graphs, Embedding Graphs Having Ore-Degree at Most Five, Forcing spanning subgraphs via Ore type conditions, Large planar subgraphs in dense graphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, Ramsey numbers for bipartite graphs with small bandwidth, Almost-spanning subgraphs with bounded degree in dense graphs
Cites Work
- Regular subgraphs of almost regular graphs
- The Ramsey number of a graph with bounded maximum degree
- Almost \(H\)-factors in dense graphs
- 2-factors in dense graphs
- Proof of a Packing Conjecture of Bollobás
- On the square of a Hamiltonian cycle in dense graphs
- On the maximal number of independent circuits in a graph
- On the structure of linear graphs
