摘要
以 Kn( p,q)表示红蓝边染色的 n阶完全图 ,图中既无 p个顶点的红边完全子图 ,也无 q个顶点的蓝边完全子图 .本文给出了 K4 0 ( 3,1 0 )的一种构造 ,以改进 Ram sey数 r( 3,1 0 )≥ 4
Let K n(p,q) be a complete graph of order n with red and blue edge coloring such that there is neither subgraph K p whose edges are all red nor subgraph K q whose edges are all blue.We give a construction of a K 40 (3,10). As a result,We obtain Ramsey number r(3,10)≥40.
出处
《内蒙古大学学报（自然科学版）》
CAS
CSCD
2000年第5期468-470,共3页
Journal of Inner Mongolia University：Natural Science Edition
