Abstract
In this paper the algorithm developed in [RK] for 2-color Ramsey numbers is generalized to multi-colored Ramsey numbers. All the cyclic graphs yielding the lower bounds R(3,3,4)>=30, R(3,3,5)>=45, and R(3,4,4)>=55 were obtained. The two last bounds are apparently new.
Publication Date
1988
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
The Journal of Combinatorial Mathematics and Combinatorial Computing 4 (1988) 87 - 96
Campus
RIT – Main Campus
COinS
Comments
ISSN:0835-3026 Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.