Regular Partitions of Hypergraphs: Regularity Lemmas

Abstract. Szemer´edi’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 authors and obtain a stronger and more “user friendly” regularity lemma for hypergraphs.

• Type: Journal
• Year: 2007
• Where: CPC
• Authors: Vojtech Rödl, Mathias Schacht
• Keywords: CPC 2007, Powerful Tool, Regularity Lemma, Subsequent Applications