期刊文献+

树图对完全图的多色Ramsey数

Multi-color Ramsey Numbers for Trees Versus Complete Graphs
原文传递
导出
摘要 首先证明了关于一般图的多色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.
作者 白路锋
出处 《数学的实践与认识》 CSCD 北大核心 2013年第13期252-254,共3页 Mathematics in Practice and Theory
基金 南京理工大学教研项目(201190)
关键词 多色RAMSEY数 平均度 独立数 multi-color ramsey numbers average degree independence numbers
  • 相关文献

参考文献6

  • 1Bollobas B. Morden Graph Theory[M]. New York: Springer, 2001.
  • 2Burr S. Ramsey numbers involving graphs with long suspended paths[J]. J London Math Soc lI Ser, 1981, 24: 405-413.
  • 3Jacobson M S. On the Ramsey Number for Stars and a Complete Graph[J]. Ars Combinatoria, 1984, 17.. 167-172.
  • 4Omidi G R and Raeisi G. A Note on the Ramsey Number of Stars - Complete Graphs[J]. European Journal of Combinatorics, 2011, 32: 598-599.
  • 5Burr S A, Roberts J A. On Ramsey Numbers for Stars[J]. Utilitas Mathematica, 1973, 4: 217- 220.
  • 6Chvatal V. Tree-complete graph ramsey numbers[J]. J Graph Theory, 1977, 1: 93.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部