Sarkozy, Gabor N.
Selkow, Stanley M.
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.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only