A hypergraph blow-up lemma
We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs.
Main Author: | Keevash, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|
Similar Items
-
Hypergraph colouring and the Lovász Local Lemma
by: McDiarmid, C
Published: (1997) -
Hypergraph matchings and designs
by: Keevash, P
Published: (2019) -
A rainbow blow-up lemma for almost optimally bounded edge-colourings
by: Stefan Ehard, et al.
Published: (2020-01-01) -
A Geometric Theory for Hypergraph Matching
by: Keevash, P, et al.
Published: (2011) -
Rainbow factors in hypergraphs
by: Coulson, M, et al.
Published: (2018)