报告摘要：
| For two given graphs G1 and G2, the Ramsey number R(G1;G2) is the smallest integer N such that for any graph of order N, either G contains a copy of G1 or its complement contains a copy of G2. Let Cm be a cycle of length m, Wn a wheel of order n + 1 and K1;n a star of order n + 1. In this talk, we will discuss the relations of the two Ramsey numbers R(C4;K1;n) and R(C4;K1;n), some new obtained values of the two Ramsey numbers and some problems related to the two Ramsey numbers.
|
