| Ramsey数下界的一个新结果 |
| |
| 引用本文： | 郭天印,杨立夫. Ramsey数下界的一个新结果[J]. 陕西理工学院学报(自然科学版), 2003, 19(3): 80-82 |
| |
| 作者姓名： | 郭天印 杨立夫 |
| |
| 作者单位： | 1. 陕西理工学院计算机系,陕西,汉中,723003
2. 陕西理工学院基础课一部,陕西,汉中,723003 |
| |
| 摘 要： | Ramsey数是组合数学中很有意义的一个数[1],但确定Ramsey数的具体数值仍是一个尚未解决的问题,因此,给出Ramsey数尽可能小的上界和尽可能大的下界是有意义的。通过构造两个图的连结图,利用连结图的性质,得到求Ramsey数下界的一个新公式,利用该公式得到的Ramsey数的下界比其它公式得到的要好。
|
| 关 键 词： | Ramsey数 团 最大独立集 连结图 |
| 文章编号： | 1002-3410(2003)03-0080-03 |
| 修稿时间： | 2003-06-27 |
A new solution to the lower bound of Ramsey number |
| |
| Abstract: | Ramsey number is of great significance in combinational maths. But how to decide its concrete numerical value is still an unsolved problem. In view of this, it is important to give the possible minimum upper bound and the possible maximum lower bound of Ramsey number. By constructing the connective graph of the two graphs and making use of the properties of the graph, a new equation of the lower bound of Ramsey number is deduced. The lower bound of Ramsey number deduced by means of this equation is better than the results deduced by other ones. |
| |
| Keywords: | Ramsey number clique maximum set of independent vertices connective graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
