论文部分内容阅读
For two given graphs G and H,the Ramsey number R(G,H)is the smallest integer N such that any red-blue edge colorings of a complete graph Kn,either there is a red copy of G or a blue copy of H.In this talk,we will introduce some new results and problems on the Ramsey numbers concerning cycles,wheels,stars and so on.