
arXiv: 1011.1355
AbstractWe 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
hypergraph regularity, Extremal problems in graph theory, hypergraphs, hypergraph embeddings, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs
hypergraph regularity, Extremal problems in graph theory, hypergraphs, hypergraph embeddings, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 22 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
