(3,11,45)-Ramsey图的递阶构造(英文)  

A Recursive Construction of (3,11,45)-Ramsey Graph

作　　者：斯勤夫[1] 段禅伦[1] 

机构地区：[1]内蒙古大学计算机学院,呼和浩特010021

出　　处：《内蒙古大学学报（自然科学版）》2005年第4期383-386,共4页Journal of Inner Mongolia University：Natural Science Edition

摘　　要：给出了10-正则循环(3,11,45)-Ramsey图的一个递阶生成构造.该正则循环图的弦长序列是:1,3,5,12,19.同时证明了拉姆赛数R(4,5) 46.进一步,我们发现了一个有趣的结果,作为(3,11,45)-Ramsey图的一个子图(3,10,38)-Ramsey图,改变(3,10,38)-Ramsey图的4条Ramsey临界边,该图将变为另一个10正则的循环(3,10,38)-Ramsey图.该正则循环图的弦长序列也是:1,3,5,12,19.A recursive construction of 10-regular cyclic (3,11,45)-Ramsey graph with chord length list {1,3,5,12,19} is given based on a (3,10,38)-Ramsey graph.R(3,11)46 is proved.An interesting fact has been found that changing the color of 4 critical Ramsey edges in the (3,10,38)-Ramsey graph from color 1 into color 2,the (3,10,38)-Ramsey graph becomes a 10-regular cyclic (3,10,38)-Ramsey graph,which has the same chord length as the (3,11,45)-Ramsey graph.

关 键 词：RAMSEY数 RAMSEY图 Ramsey临界边 

分 类 号：O157[理学—数学]