Chromatic Ramsey numbers

Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let Mn = minfrc(G) : (G) = ng. It was conjectured by S. A. Burr, P.

• Type: Journal
• Year: 1998
• Where: DM
• Authors: Xuding Zhu
• Keywords: Chromatic Number, Chromatic Ramsey Number, DM 1998, Monochromatic Subgraph