THE UNIFORMITY LEMMA FOR HYPERGRAPHS

被引：51
作者：
FRANKL, P
RODL, V
机构：
[1] CNRS,F-75270 PARIS 06,FRANCE
[2] EMORY UNIV,ATLANTA,GA 30322
来源：
GRAPHS AND COMBINATORICS | 1992年 / 8卷 / 04期
关键词：
D O I：
10.1007/BF02351586
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 to r-uniform hypergraphs.
引用
收藏
页码：309 / 312
页数：4
相关论文
共 3 条
[1]   THE ASYMPTOTIC NUMBER OF GRAPHS NOT CONTAINING A FIXED SUBGRAPH AND A PROBLEM FOR HYPERGRAPHS HAVING NO EXPONENT [J].
ERDOS, P ;
FRANKL, P ;
RODL, V .
GRAPHS AND COMBINATORICS, 1986, 2 (02) :113-121
[2]   EXACT SOLUTION OF SOME TURAN-TYPE PROBLEMS [J].
FRANKL, P ;
FUREDI, Z .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1987, 45 (02) :226-262
[3]  
Szemeredi E., 1976, PROBLEMES COMBINATOI, P399
1