Title of article
Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers Original Research Article
Author/Authors
Li Guiqing، نويسنده , , Su Wenlong، نويسنده , , Luo Haipeng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
13
From page
167
To page
179
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.
Keywords
Edge coloring , Ramsey number , Lower bound , Circulant graph
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885510
Link To Document