It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs K-m (n) can be bounded from below by cn(2)2((m-1)n), where c is a positive constant.
科研之友
微信
新浪微博
Facebook
分享链接
