Abstract
We show that the classical Ramsey number R(3,3,3,3) is no greater than 62. That is, any edge coloring with four colors of a complete graph on 62 vertices must contain a monochromatic triangle. Basic notions and a historical overview are given along with the theoretical framework underlying the main result. The algorithms for the computational verification of the result are presented along with a brief discussion of the software tools that were utilized.
Publication Date
2004
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
Ars Combinatoria LXXII (2004) 41-63
Campus
RIT – Main Campus
COinS
Comments
This article is also available at the journal's main page at: http://bkocay.cs.umanitoba.ca/arscombinatoria/index.html ISSN:0381-7032 Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.