Abstract.
A color pattern is a graph whose edges are partitioned into color classes. A family F of color patterns is a Ramsey family if there is some integer N such that every edge-coloring of K
N
has a copy of some pattern in F. The smallest such N is the (pattern) Ramsey number R(F) of F. The classical Canonical Ramsey Theorem of Erdös and Rado [4] yields an easy characterization of the Ramsey families of color patterns. In this paper we determine R(F) for all families consisting of equipartitioned stars, and we prove that 
when F consists of a monochromatic star of size s and a polychromatic triangle.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Acknowledgments. We thank the referees for pointing out several references where related results appeared.
Project sponsored by the National Security Agency under Grant Number MDA904-03-1-0037. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation herein.
Final version received: January 9, 2004
Rights and permissions
About this article
Cite this article
Jamison, R., West, D. On Pattern Ramsey Numbers of Graphs. Graphs and Combinatorics 20, 333–339 (2004). https://doi.org/10.1007/s00373-004-0562-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0562-y