The Uniformity Lemma for hypergraphs
The Uniformity Lemma for hypergraphs
复制标题
超图的一致性引理
DOI:
10.1007/bf02351586
复制
发表时间:
1992
影响因子:
0.7
通讯作者:
V. Rödl
中科院分区:
文献类型:
--
作者:
P. Frankl;V. Rödl
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.