An Upper bound of 62 on the classical Ramsey number(3,3,3,3)

Show full item record

Title: An Upper bound of 62 on the classical Ramsey number(3,3,3,3)
Author: Fettes, Susan; Kramer, Richard; Radziszowski, Stanislaw
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.
Description: This article is also available at the journal's main page at: http://bkocay.cs.umanitoba.ca/arscombinatoria/index.html
Record URI: http://hdl.handle.net/1850/7998
Date: 2004

Files in this item

Files Size Format View
SRadziszowskiArticle07-2004.pdf 239.9Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse