The lower bounds for any R（l1,…,lq;r）are investigated.Let Knr be the completer-uniform hypergraph on n points.Define R（l1,…,lq;r）as the minimal natural number n sothat if the edges of Knr are q-colored,there is a set S of li（i∈{1,…,q}）vertices such that alledges on S are of the i-th color.For the special case of q=r=2,the lower bounds were got byP.Erd（?）s and J.Spencer.In this paper,we shall give the lower bounds for any R（l1,…,lq;r）.
展开▼
机译：研究的下界（L 1 ，...，l q ; r）。k n r 是n个点上的自动鼠均匀的超图。 k n r 是q-彩色的，L i （i∈{1，...，q}）顶点有一个设置的s S上的Alledges是I-TH的颜色。对于q = r = 2的特殊情况，越界被byp.erd（？）s和j.spencer.in，我们将给出下限对于任何R（l 1 ，...，l q ; r）。
展开▼
