Type: Article
Publication Date: 2007-07-31
Citations: 123
DOI: https://doi.org/10.1017/s0963548307008553
Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.