摘要
C·M·Grinstead和S·M·Roberts在文献[1]中证明了Ramsey数R(3,8)的界:28≤R(3,8)≤29。澳大利亚的Brendan D.Mckay教授和南京大学的张克民教授于1990年借助计算机证明了R(3,8)=28。在Mckay和张克民做这项工作的同时,我们独立地对(3,8,28)一图的结构,从理论上进行了较深入的探讨,并为下一篇文章:关于(3,8,28)一图的计算机算法,准备了理论基础。
C·M·Grinstead and S·M·Roberts showed that the lower and the upper hound of the Ramsey number R(3, 8)are 28 and 29,respectively.Australian Prof.Brendan D.Mckay and Chinese Prof.Zhang Kemin (Nanjing University) proved that R(3,8)is 28 with the help of computer in 1990.While Mckay and Zhang were doing this by computer, independently We did some deep theoretical research on the structure of(3,8,28)-graph, and provided the theoretical foundation for the next paper, which gives the computer algorithms on the (3,8,28)—graph.
出处
《北京联合大学学报》
CAS
1991年第2期31-36,共6页
Journal of Beijing Union University
基金
国家自然科学基金
