Szemeredi'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.
['Vojtech Rödl', 'Mathias Schacht']
Regular Partitions of Hypergraphs: Regularity Lemmas