Back to search

Rochester Institute of Technology

Some Multicolor Ramsey Numbers Involving Cycles

Abstract

dc:description.abstract

Establishing the values of Ramsey numbers is, in general, a difficult task from the computational point of view. Over the years, researchers have developed methods to tackle this problem exhaustively in ways that require intensive computations. These methods are often backed by theoretical results that allow us to cut the search space down to a size that is within the limits of current computing capacity. This thesis focuses on developing algorithms and applying them to generate Ramsey colorings avoiding cycles. It adds to a recent trend of interest in this particular area of finite Ramsey theory. Our main contributions are the enumeration of all (C_5,C_5,C_5;n) Ramsey colorings and the study of the Ramsey numbers R(C_4,C_4,K_4) and R4(C_5).

Degree

thesis:*
Name thesis:degree_name
Computer Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science (GCCIS)

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Narvaez, David E
Contributors dc:contributor
  • Stanislaw P. Radziszowski

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/8665

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Narvaez, David E. Some Multicolor Ramsey Numbers Involving Cycles. Thesis thesis, https://repository.rit.edu/theses/8665