| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654208 | European Journal of Combinatorics | 2010 | 9 Pages |
Abstract
For graphs G1,â¦,Gs, the multicolor Ramsey number R(G1,â¦,Gs) is the smallest integer r such that if we give any edge coloring of the complete graph on r vertices with s colors then there exists a monochromatic copy of Gi colored with color i, for some 1â¤iâ¤s. In this work the multicolor Ramsey number R(Kp1,â¦,Kpm,K1,q1,â¦,K1,qn) is determined for any set of complete graphs and stars in terms of R(Kp1,â¦,Kpm).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
L. Boza, M. Cera, P. GarcÃa-Vázquez, M.P. Revuelta,