JCT
2011
13 years 7 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...
JCT
2000
14 years 16 days 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...
COMBINATORICS
2002
14 years 17 days ago
2002
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
DM
2007
14 years 21 days ago
2007
In this paper, we obtain some new results R(5, 12) 848, R(5, 14) 1461, etc., and we obtain new upper bound formulas for Ramsey numbers with parameters. © 2006 Published by Elsevi...
DAM
2007
14 years 21 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 ...
JCT
2008
14 years 22 days ago
2008
Chv