Sciweavers

Share
DM
1998

Chromatic Ramsey numbers

8 years 3 months ago
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.
Xuding Zhu
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where DM
Authors Xuding Zhu
Comments (0)
books