A hypergraph blow-up lemma

Details A hypergraph blow-up lemma A hypergraph blow-up lemma

2010-11-05

arxiv.org/abs/1011.1355v1

Mathematics

Combinatorics

102 pages, 1 figure, to appear in Random Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A hypergraph blow-up lemma does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A hypergraph blow-up lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A hypergraph blow-up lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453878