未找到相关数据
LOWER BOUNDS OF RAMSEY NUMBERS
被引：0
作者：
阚家海
机构：
[1] Nanjing Institute of Posts & Telecommunications Nanjing
[2] China
关键词：
Ramsey numbers;
lower bounds;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
<正> The lower bounds for any R（l1,…,lq;r）are investigated.Let K_nr be the completer-uniform hypergraph on n points.Define R（l1,…,lq;r）as the minimal natural number n sothat if the edges of K_nr 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）.
引用
收藏
页码：97 / 101
页数：5
相关论文