用自同构循环图计算Ramsey数R(3,q)的下界

Lower bounds for R(3,q) based on automorphism cyclic graphs

确定经典Ramsey数的下界是组合数学中非常困难的问题,因而人们常用各种方法计算它的界。发现一种新的方法,即自同构循环图的方法,计算得到三个经典Ramsey数的新下界:R(3,30)≥188,R(3,33)≥217,R(3,34)≥225。

It is a very difficult problem to give lower bounds for classical Ramsey numbers in combinatorics, so people use many different methods to compute their bounds. This paper gave a new method based on automorphism cyclic graphs, and got new lower bounds for three Ramsey numbers： R（3,30） ≥188 ,R（3,33） ≥217 ,R（3,34） ≥225.