Sciweavers

266 search results - page 1 / 54
» Chromatic Ramsey numbers
Sort
View
DM
1998
118views more  DM 1998»
13 years 4 months ago
Chromatic Ramsey numbers
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
Xuding Zhu
JGT
2010
103views more  JGT 2010»
13 years 3 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
JGT
2010
127views more  JGT 2010»
13 years 3 months ago
On the minimum degree of minimal Ramsey graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
Tibor Szabó, Philipp Zumstein, Stefanie Z&u...
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 4 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
ARSCOM
2004
175views more  ARSCOM 2004»
13 years 4 months ago
Circular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
Changiz Eslahchi, Arash Rafiey