首页 | 本学科首页   官方微博 | 高级检索  
     

完全图的循环图分解和5个Ramsey数的下界
引用本文:黎贞崇,苏文龙,罗海鹏. 完全图的循环图分解和5个Ramsey数的下界[J]. 河北大学学报(自然科学版), 2000, 20(1): 10-14
作者姓名:黎贞崇  苏文龙  罗海鹏
作者单位:1. 广西省科学院,广西,南宁,530031
2. 广西省计算中心,广西,南宁,530022
基金项目:Grant-in-Aid from the International Center for Diffraction Data,9920001,
摘    要:研究了素数阶完全图分解为循环图的方法 ,给出了计算它的子图的团数的一种算法 ,得到2个三色 ,3个四色Ramsey 数的新的下界 :R(3,4,18)≥458,R(3,6,19)≥882,R(3,3,4,15)≥770,R(3,3,4,16)≥812,R(3,3,5,16)≥1124。

关 键 词:Ramsey数  下界  循环图  算法
文章编号:1000-1565(2000)01-0010-05
修稿时间:1999-02-08

On Decompositions of a Complete Graph into Circulant Graphs and the Lower Bounds of Five Ramsey Numbers
LI Zhen-chong,SU Wen-long,LUO Hai-peng. On Decompositions of a Complete Graph into Circulant Graphs and the Lower Bounds of Five Ramsey Numbers[J]. Journal of Hebei University (Natural Science Edition), 2000, 20(1): 10-14
Authors:LI Zhen-chong  SU Wen-long  LUO Hai-peng
Affiliation:LI Zhen-chong(Guangxi Academy of Sciences,Nanning 530031,China)SU Wen-long(Guangxi Computing Center,Nanning 530022,China)LUO Hai-peng(Guangxi Academy of Sciences,Nanning 530031,China)
Abstract:The method that complete graphs of prime order decomposites into some circulant graphs was studied. An algorithm for computing clique numbers of subgraphs of the complete graph was developed. New lower bounds of two 3-color and three 4-color Ramsey numbers were obtained:R(3,4,18)≥458, R(3,6,19)≥882, R(3,3,4,15)≥770, R(3,3,4,16)≥812, R(3,3,5,16)≥1124.
Keywords:Ramsey number  lower bound  circulant graph  algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号