## The counting lemma for regular k-uniform hypergraphs (2004)

### Cached

### Download Links

by
Brendan Nagle
,
Vojtech Rödl
,
Mathias Schacht

Citations: | 71 - 12 self |

### BibTeX

@MISC{Nagle04thecounting,

author = {Brendan Nagle and Vojtech Rödl and Mathias Schacht},

title = {The counting lemma for regular k-uniform hypergraphs },

year = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

Szemerédi’s Regularity Lemma proved to be a powerful tool in the area of extremal graph theory. Many of its applications are based on its accompanying Counting Lemma: If G is an ℓ-partite graph with V (G) = V1 ∪ · · · ∪ Vℓ and |Vi | = n for all i ∈ [ℓ], and all pairs (Vi, Vj) are ε-regular of density d for ℓ 1 ≤ i < j ≤ ℓ, then G contains (1 ± fℓ(ε))d