Abstract
With the help of computer algorithms, we improve the upper bound on the classical three color Ramsey number R(3,3,4), and thus we show that the exact value of this number is 30 or 31. We also present computer enumeration of all 3-colorings of edges on at least 14 vertices without monochromatic triangles.
Publication Date
1998
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
The Journal of Combinatorial Mathematics and Combinatorial Computing 27 (1998) 135-141
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.