摘要
确定Ramsey数一直是图论中的一个难题。讫今为止,已被确定的Ramsey数亦为数不多。有关Ramsey数的一些著名结果是关于它的界限的。本文通过群论的方法,得到了一些Ramsey数的下界,在一定条件下,它们比已知的著名结果要好。
In graph theory, it is extremely difficult to determine the Ramsey numbers. Up to now, only a few ramsey numbers have been determined. Among them some famous results are dealing with the lower bounds or upper bounds. In this paper, some new lower bounds are obtained by means of group theory under a certain condition which are much better than those famous ones.
出处
《烟台大学学报(自然科学与工程版)》
CAS
1992年第1期5-7,共3页
Journal of Yantai University(Natural Science and Engineering Edition)