z-logo
Premium
A hypergraph blow‐up lemma
Author(s) -
Keevash Peter
Publication year - 2011
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20362
Subject(s) - hypergraph , lemma (botany) , mathematics , embedding , bounded function , combinatorics , graph , discrete mathematics , struct , computer science , mathematical analysis , artificial intelligence , ecology , poaceae , biology , programming language
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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here