61 search results - page 4 / 13 » Semi-algebraic Ramsey numbers |
100
click to vote
DM
2007
15 years 17 days ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
145
click to vote
GC
2011
Springer
14 years 7 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
EJC
2008
15 years 21 days ago
2008
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...
97
Voted
COMBINATORICS
1999
15 years 9 days 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 ...
123
Voted
DAM
2007
15 years 18 days 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 ...