Regular Partitions of Hypergraphs: Regularity Lemmas

Authors:
Vojtech Rodl;Mathias Schacht
Affiliations:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: rodl@mathcs.emory.edu);Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany (e-mail: schacht@informatik.hu-berlin.de)
Venue:
Combinatorics, Probability and Computing
Year:
2007

Citing 0
Cited 5

Hereditary properties of hypergraphs

Journal of Combinatorial Theory Series B
Hypergraph regularity and quasi-randomness

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Weak hypergraph regularity and linear hypergraphs

Journal of Combinatorial Theory Series B
Hamilton ℓ-cycles in uniform hypergraphs

Journal of Combinatorial Theory Series A
Testable and untestable classes of first-order formulae

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.