研究Ramsey数下界的问题,发现了Paley图的一个新的自同构,形成计算Paley图团数的一个新方法,为解决Radziszowski问题提供一个新思路,获得阶段性成果:计算出14813阶Paley图的团数,得到一个对角Ramsey数的新下界:R(23,23)〉129629。%The paper studies the lower bounds for Ramsey numbers. In light of a new discovery automorphism of Paley Graphs, a new method of computing clique numbers of Paley graphs is proposed, which sheds new light on solving the problem raised by Radziszowski. Staged results are obtained: the clique number of Paley graphs with order 14813 is computed and a new lower bound for diagonal Ramsey numbers R(23,23)t〉29629 is obtained
展开▼