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).
Library of Congress Subject Headings
Ramsey numbers; Graph coloring; Paths and cycles (Graph theory)
Computer Science (MS)
Department, Program, or Center
Computer Science (GCCIS)
Stanislaw P. Radziszowski
Narvaez, David E., "Some Multicolor Ramsey Numbers Involving Cycles" (2015). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus