树图对完全图的多色Ramsey数  

Multi-color Ramsey Numbers for Trees Versus Complete Graphs

作　　者：白路锋[1] 

机构地区：[1]南京理工大学泰州科技学院,江苏泰州225300

出　　处：《数学的实践与认识》2013年第13期252-254,共3页Mathematics in Practice and Theory

基　　金：南京理工大学教研项目(201190)

摘　　要：首先证明了关于一般图的多色Ramsey数的一个下界,该下界是一类星图对完全图的多色Ramsey数的精确下界;其次证明了关于星图对完全图的多色Ramsey数的上界,该上界是一类星图对完全图的多色RamSey数的精确上界;最后证明关于树图对完全图的多色Ramsey数的上界.In this paper,we obtain lower bounds on multi-color Ramsey numbers, which are sharp bounds of multi-color Ramsey numbers for stars versus complete graphs. Secondly, we obtain upper bounds of multi-color Ramsey numbers for stars versus complete graphs, which are sharp bounds for some stars versus complete graphs. Lastly, we obtain upper bounds of multi-color Ramsey numbers for trees versus complete graphs.

关 键 词：多色RAMSEY数 平均度 独立数 

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