A hypergraph blow-up lemma
Combinatorics
2010-11-08 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1011.1355,
title = {A hypergraph blow-up lemma},
author = {Peter Keevash},
journal= {arXiv preprint arXiv:1011.1355},
year = {2010}
}
Comments
102 pages, 1 figure, to appear in Random Structures and Algorithms