| 引用本文： |
-
罗海鹏,苏文龙.经典Ramsey数R(7,21)的下界[J].广西科学院学报,1998,(1):10-11. [点击复制]
- Luo Haipeng,Su Wenlong.Lower Bound of Classical Ramsey Number R(7,21)[J].Journal of Guangxi Academy of Sciences,1998,(1):10-11. [点击复制]
|
|
| 摘要: |
| 通过计算机构造了一个新的641阶循环图,它既不含任何的7点团,也不含任何的21独立点集,从而获得了Ramsey数R(7,21)的一个下界:R(7,21)≥ 642.这个结果填补了Ramsey数研究的一个空白. |
| 关键词: Ramsey数 下界 素数阶循环图 |
| DOI： |
| 投稿时间：1997-09-23 |
| 基金项目:广西科学基金 |
|
| Lower Bound of Classical Ramsey Number R(7,21) |
|
Luo Haipeng1, Su Wenlong2
|
| (1.Guangxi Academy of Sciences, Nanning, 530031;2.Wuzhou No.1 Middle School of Guangxi, Wuzhou, 543002) |
| Abstract: |
| A new 641 order cyclic graph was constructed by computer, it contains neither 7-point clique nor subset of 21 isolated points, so lower bound of Ramsey number R(7, 21) was obtained R(7, 21) ≥ 642. The result fills a blank in the research of Ramsey number. |
| Key words: Ramsey number lower bound prime order cyclic graph |
