We would like to thank Jim Mims, our faculty sponsor, for all of his time and effort in ensuring our success. His approach gave us an ideal balance of independence versus guidance that helped us get as much as possible from the Challenge.
We would also like to extend our thanks to David Metzler, Ph.D., our project mentor. Dr. Metzler was not only also instrumental in keeping us on task, but also provided us with invaluable information about what had hindered mathematical researchers attempting problems like ours that require high performance computers. He also warned us about what we were getting into, encouraging us to look at the problem and find what other side-problems we should explore as well.
We also appreciate all the help, guidance, and support from the everyone on the Supercomputing Challenge’s staff. From their very useful comments during the February project evaluation to their help in possibly securing time on a supercomputer, we truly appreciate all their time and effort.
References on Ramsey Numbers
Exoo, Geoffrey. “Ramsey Numbers,” http://isu.indstate.edu/ge/RAMSEY/
Haanpää, Harri. “Computational Methods for Ramsey Numbers,” http://citeseer.ist.psu.edu/660990.html
Radziszowski, Stanisław P. “Small Ramsey Numbers,” http://www.combinatorics.org/Surveys/ds1/sur.pdf
Rosta, Vera. “Ramsey Theory Applications,” http://www.combinatorics.org/Surveys/ds13.pdf
Weisstein, Eric W. Wolfram MathWorld, “Ramsey Number,” http://mathworld.wolfram.com/RamseyNumber.html
Wikipedia, “Ramsey's theorem,” http://en.wikipedia.org/wiki/Ramsey's_theorem
References on Algorithms and Programming
Dynamic programming. (2007, April 3). In Wikipedia. Retrieved April 3, 2007, from Wikimedia Foundation Web site: http://en.wikipedia.org/wiki/Dynamic_programming
Gilleland, M. (n.d.). Combination Generator. Retrieved April 2, 2007, from Merriam Park Software Web site: http://www.merriampark.com/comb.htm
Knuth, D. E. (2005). Fascicle 3. In The Art of Computer Programming: Vol. 4. Generating All Combinations and Partitions. Upper Saddle River, NJ: Pearson.
Knuth, D. E. (2005). Fascicle 2. In The Art of Computer Programming: Vol. 4. Generating All Tuples and Permutations. Upper Saddle River, NJ: Pearson.
Rosen, K. H. (1991). Discrete Mathematics and Its Applications (2nd ed.). NY: McGraw-Hill.