Sciweavers

GC
2011
Springer
13 years 5 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
Tao Jiang, Michael Salerno
DM
2002
101views more  DM 2002»
13 years 10 months ago
On generalized Ramsey numbers
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
DM
2007
116views more  DM 2007»
13 years 10 months ago
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. ...
COMBINATORICS
2007
121views more  COMBINATORICS 2007»
13 years 10 months ago
A Bound for Size Ramsey Numbers of Multi-partite Graphs
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...
Yuqin Sun, Yusheng Li
EJC
2006
13 years 10 months ago
A note on Ramsey numbers with two parameters
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...
Yi Ru Huang, Jian Sheng Yang, Kemin Zhang