Student Work
Algorithmic evaluation of Ramsey numbers
PublicRamsey 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.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- 01D181M
- Advisor
- Year
- 2001
- Date created
- 2001-01-01
- Resource type
- Major
- Rights statement
- Dernière modification
- 2021-10-11
Relations
- Dans Collection:
Contenu
Permanent link to this page: https://digital.wpi.edu/show/cz30pw49w