Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

Rainbow Ramsey Numbers
by
Colton Magnant
Emory University
Coauthors: Ralph Faudree Mike Jacobson Ron Gould

Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n vertices contains either a rainbow triangle or a monochromatic copy of the graph G. This number, called the rainbow ramsey number is found for a variety of graph classes.

Date received: February 7, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-02.