Combinatorics Probability Computing · 2007 · 62 citations · 15 references
Natural SciencesComputer ScienceMathematicsCombinatoricsCombinatorial Number TheoryEnumerative CombinatoricsGraph TheoryHypergraph TheoryPartition RegularityRegularity Theory
We continue the study of regular partitions of hypergraphs. In particular, we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from our paper ‘Regular Partitions of Hypergraphs: Regularity Lemmas’ (in this issue).
15
Regularity Lemma for k‐uniform hypergraphs
Vojtěch Rödl, Jozef Skokan · Random Structures and Algorithms · 2004 · 266 citations
The counting lemma for regular k-uniform hypergraphs
Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 2004 · 234 citations
A variant of the hypergraph removal lemma
Terence Tao · Journal of Combinatorial Theory Series A · 2006 · 191 citations