Abstract
In 1973, E. Szemeredi proved a theorem which found numerous applications in extremal combinatorial problems—The Uniformity Lemma for Graphs. Here we consider an extension of Szemeredi's theorem tor-uniform hypergraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Erdös, P., Frankl, P., Rödl, V. (1986): The Asymptotic Number of Graphs not Containing a Fixed Subgraph and a Problem for Hypergraphs Having no Exponent. Graphs and Combinatorics2, 113–121
Frankl, P., Füredi, Z. (1987): Exact Solution of Some Turan-Type Problems, JCT A45, 226–262
Szemeredi, E. (1976): Regular Partitions of Graphs, Proc. Colloq. Int. CNRS, pp. 399–401. Paris CNRS
Author information
Authors and Affiliations
Additional information
The work on this paper was done while the authors were visiting AT&T Bell Laboratories in 1985
Rights and permissions
About this article
Cite this article
Frankl, P., Rödl, V. The Uniformity Lemma for hypergraphs. Graphs and Combinatorics 8, 309–312 (1992). https://doi.org/10.1007/BF02351586
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02351586