A hypergraph blow-up lemma
classification
🧮 math.CO
keywords
blow-uphypergraphhypergraphslemmaatypicalbehaveboundedcomplete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.