The Extended Ramsey Problem

WPI Master's Thesis Candidate

Nastaran Baradaran

Wednesday, August 23, 2000
3:30 a.m.
Fuller Labs 246

Abstract

This thesis addresses the design of a particular algorithm concerned with edge coloring of a complete graph. It provides new results and proves a general bound on the number of colors needed for a (p,q)-coloring.

Host

Prof. Stanley Selkow

Maintained by webmaster@wpi.edu
Last modified: Sep 27, 2006, 16:05 EDT