论文部分内容阅读
本文给出完全二分图K_2,n的Ramsey数r(K_2,n)的上界:r(K_2,n)≤4_n—2,特别地当n是素数时等式严格地成立。
In this paper, we give the upper bound of the Ramsey number r(K_2,n) of the complete bipartite graph K_2,n:r(K_2,n)≤4_n-2, especially when n is a prime number.