Sciweavers

JCT
2011
115views more  JCT 2011»
13 years 6 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
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...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
JCT
2000
110views more  JCT 2000»
13 years 11 months ago
Unordered Canonical Ramsey Numbers
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...
Duncan C. Richer
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 11 months ago
New Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
Aaron Robertson
DM
2007
89views more  DM 2007»
13 years 11 months ago
New upper bound formulas with parameters for Ramsey numbers
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...
Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian She...
DAM
2007
70views more  DAM 2007»
13 years 11 months ago
Path-kipas Ramsey numbers
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 ...
A. N. M. Salman, H. J. Broersma
JCT
2008
92views more  JCT 2008»
13 years 11 months ago
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chv
Oliver Cooley, Nikolaos Fountoulakis, Daniela K&uu...