Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers

  • Authors:

  • Li Guiqing;Su Wenlong;Luo Haipeng

  • Affiliations:

  • The State Key Lab of CAD& CG, Zhejiang University, Hangzhou, 310027, China;Guangxi University Wuzhou Branch, Wuzhou 543002, China;Guangxi Academy of Sciences, 32 Xinghu Road, Nanning 530022, China

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2003

Quantified Score

Hi-index 0.04

Visualization

Abstract

An algorithm for calculating the clique numbers of circulant graphs is developed and applied to some circulant graphs of order 149. Then a constructive method is designed to study edge colorings of the complete graph Kp. Three new lower bounds for Ramsey numbers are obtained by using this method. They are: R(3,3,11) ≥ 150, R(3,4,8) ≥ 150, R(3,26) ≥ 150.