|
Organizers |
On mixed Ramsey numbers
by
Maria Axenovich
Dept. of Mathematics, Iowa State University
For two graphs, G and H, an edge-coloring of Kn is (G, H)-good if there are no monochromatic copies of G and there are no totally multicolored copies of H. We say that S(n, G, H) = { i: there is a (G, H)-good coloring of Kn with i colors } is a spectrum of (G, H)-colorings. It is an open question whether S(n, G, H) is an interval. In this talk we address this question and provide some tight bounds for corresponding mixed anti-Ramsey numbers.
Date received: May 4, 2009
Copyright © 2009 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 # cayq-66.