DM
1998
14 years 7 days ago
1998
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...
DM
2008
14 years 19 days ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...