Faculty Advisor

Sarkozy, Gabor N.

Faculty Advisor

Selkow, Stanley M.

Abstract

Ramsey Theory states that there exists a Ramsey Number. This number is the minimum number of nodes needed to guarantee that no matter how the edges of a complete graph of that order are two-colored, that there is a monochromatic subgraph, or clique, of either of the two colors. This project evaluates methods for finding Ramsey Numbers, a process that is NP complete. The goal of this project is to prove that R(5,5) is greater than 20.

Publisher

Worcester Polytechnic Institute

Date Accepted

January 2001

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Restricted-WPI community only

Advisor Department

Computer Science

Advisor Program

Computer Science

Share

COinS