The counting lemma for regular k-uniform hypergraphs 论文

摘要

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