266 search results - page 10 / 54 » Chromatic Ramsey numbers |
COMBINATORICS
1999
13 years 7 months ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
DAM
2007
13 years 7 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
DM
2006
13 years 7 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
EJC
2010
13 years 7 months ago
2010
