- 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.
- Publisher copy:
- Copyright date:
- 102 pages, 1 figure, to appear in Random Structures and Algorithms
A hypergraph blow-up lemma
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record