61 search results - page 1 / 13 » Semi-algebraic Ramsey numbers |
JCT
2011
12 years 11 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
COMBINATORICS
2002
13 years 4 months ago
2002
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
DCG
2008
13 years 4 months ago
2008
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
COMBINATORICS
2007
13 years 4 months ago
2007
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
JCT
2000
13 years 4 months ago
2000
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growt...