|
|||||
|
|
| LOWER BOUNDS OF RAMSEY NUMBERS | |
| 作者姓名： | 阚家海 |
| 作者单位： | Nanjing Institute |
| 摘 要： | The lower bounds for any R(l_1,…,l_q;r)are investigated.Let K_n~r be the completer-uniform hypergraph on n points.Define R(l_1,…,l_q;r)as the minimal natural number n sothat if the edges of K_n~r are q-colored,there is a set S of l_i(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(l_1,…,l_q;r). |
LOWER BOUNDS OF RAMSEY NUMBERS |
|
| Kan Jiahai.LOWER BOUNDS OF RAMSEY NUMBERS[J].Journal of Systems Science and Complexity,1990(2). | |
| Authors: | Kan Jiahai |
| Abstract: | |
| Keywords: | Ramsey numbers lower bounds |
| 本文献已被 CNKI 等数据库收录！ | |