Regularity Lemma for k‐uniform hypergraphs

doi:10.1002/rsa.20017

Regularity Lemma for k‐uniform hypergraphs

2004-06-09

0

PRE

AI

DOI：10.1002/rsa.20017

原文链接

原文求助

摘要

En 中文

AbstractSzemerédi's Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi‐randomness, Random Structures Algorithms 2 (1991), 241–252], Frankl and Rödl [The uniformity lemma for hypergraphs, Graphs Combin 8 (1992), 309–312; Extremal problems on set systems, Random Structures Algorithms 20 (2002), 131–164] considered several extensions of Szemerédi's Regularity Lemma to hypergraphs. In particular, [Extremal problems on set systems, Random Structures Algorithms 20 (2002), 131–164] contains a regularity lemma for 3‐uniform hypergraphs that was applied to a number of problems. In this paper, we present a generalization of this regularity lemma to k‐uniform hypergraphs. Similar results were recently independently and alternatively obtained by W. T. Gowers. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004

Regularity Lemma for k‐uniform hypergraphs

摘要

AI总结

期刊

机构

引用论文