Journal article
A hypergraph blow-up lemma
- 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.
Actions
Authors
Bibliographic Details
- Journal:
- Random Struct. Algorithms
- Volume:
- 39
- Issue:
- 3
- Pages:
- 275-376
- Publication date:
- 2010-11-05
- DOI:
- EISSN:
-
1098-2418
- ISSN:
-
1042-9832
- Source identifiers:
-
430651
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:430651
- UUID:
-
uuid:1f491ad8-5587-46d2-88f2-46986e713ab6
- Local pid:
- pubs:430651
- Deposit date:
- 2013-11-16
Terms of use
- Copyright date:
- 2010
- Notes:
- 102 pages, 1 figure, to appear in Random Structures and Algorithms
If you are the owner of this record, you can report an update to it here: Report update to this record