60 search results - page 1 / 12 » Path-kipas Ramsey numbers |
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.
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...
EJC
2006
13 years 4 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...
JCT
2011
12 years 12 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...