A hypergraph blow‐up lemma
Author:
- 10 May 2011
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 39 (3) , 275-376
Abstract
No abstract availableKeywords
All Related Versions
This publication has 40 references indexed in Scilit:
- Embeddings and Ramsey numbers of sparse κ-uniform hypergraphsCombinatorica, 2009
- An exact minimum degree condition for Hamilton cycles in oriented graphsJournal of the London Mathematical Society, 2008
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- On exchangeable random variables and the statistics of large graphs and hypergraphsProbability Surveys, 2008
- A variant of the hypergraph removal lemmaJournal of Combinatorial Theory, Series A, 2006
- The counting lemma for regulark‐uniform hypergraphsRandom Structures & Algorithms, 2006
- Proof of the Alon–Yuster conjectureDiscrete Mathematics, 2001
- Tiling Turán TheoremsCombinatorica, 2000
- Blow-up LemmaCombinatorica, 1997
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967