Affordable Access

Publisher Website

Edge colorings of the complete graphK149and the lower bounds of three Ramsey numbers

Authors
Journal
Discrete Applied Mathematics
0166-218X
Publisher
Elsevier
Publication Date
Volume
126
Identifiers
DOI: 10.1016/s0166-218x(02)00245-7
Keywords
  • Ramsey Number
  • Lower Bound
  • Circulant Graph
  • Edge Coloring
Disciplines
  • Computer Science
  • Design

Abstract

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 K p . 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.

There are no comments yet on this publication. Be the first to share your thoughts.