期刊文献+

素数阶循环图与经典Ramsey数R(8,19)和R(8,20)的新下界

PRIME ORDER CYCLIC GRAPH AND NEW LOWER BOUNDS OF CLASSICAL RAMSEY NUMBERS R(8,19) AND R(8,20)
下载PDF
导出
摘要 该文研究了素数阶循环图的基本性质,提出了寻求有效参数构造正则循环图的新方法,得到了2个经典Ramsey数的新的下界:R(8,19)≥702,R(8,20)≥770。这两个结果填补了关于Ramsey数综述[4]的上下界表中的2个空白。 Basic characters of prime order cyclic graph were studied.Some skills for seeking effective parameters to structure regular cyclic graph were released.New lower bounds of two classical Ramsey numbers were obtained as follows:R(8,19)≥702,R(8,20)≥770.The above two results have filled in two blanks in the table of upper and lower bounds in the survey on Ramsey numbers.
出处 《广西师院学报(自然科学版)》 1998年第3期33-37,共5页 Journal of Guangxi Teachers College(Natural Science Edition)
基金 广西自然科学基金
关键词 RAMSEY数 下界 循环图 素数阶循环图 Ramsey number,lower bound,regular cyclic graph.
  • 相关文献

参考文献7

  • 1B.D. McKay and Zhang Ke Min. The Value of the Ramsey Number R (3, 8). Journal of Graph Theory, 1992, 16: 99-105.
  • 2B.D. McKay and S. P. Radziszowski. R (4, 5) =25. Journal of Graph Theory, 1995, 19,309-322.
  • 3S.P. Radziszowski. Small Ramsey Numbers. The Electronic Journal of Combinatorics, (1996年版), 1. DSI: 1-29.
  • 4J.G. Kalbfeisch. Chromatic Graphs and Ramsey's Theorm. Ph. D. thesis, University of Water loo, January 1966.
  • 5S.P. Radziszowski and D. L. Kreher. Search Algorithm for Ramsey Graphs by Union of Group Orbits. Journal of Graph Theory, 1988, 12: 59-72.
  • 6G. Exoo. Applying Optimization Algorithm to Ramsey Problems. in Graph Theory, Combinatorics, Algorithms, and Applications (Y. Alavi ed), SIAM Philadelphia, 1989, 175-179.
  • 7K. Piwakowski. Applying Tabu Search to Determine New Ramsey Graphs. The Electronic Jour nal of Combinatorics, #R6, 1996, 3.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部