A hypergraph blow‐up lemma |
| |
Authors: | Peter Keevash |
| |
Affiliation: | School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK |
| |
Abstract: | We obtain a hypergraph generalisation of the graph blow‐up lemma proved by Komlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 275–376, 2011 |
| |
Keywords: | hypergraphs hypergraph regularity hypergraph embeddings |
|
|