18 search results - page 1 / 4 » An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, ... |
ARSCOM
2004
13 years 5 months ago
2004
COMBINATORICS
1999
13 years 5 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 ...
EJC
2006
13 years 5 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
DM
2010
13 years 5 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
DAM
2007
13 years 5 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 ...