引用本文
  • 许晓东,罗海鹏,苏文龙,吴康.关于顶点Folkman数的新不等式[J].广西科学,2006,13(4):249-252.    [点击复制]
  • XU Xiao-dong,LUO Hai-peng,SU Wen-long,WU Kang.New Inequalities on Vertex Folkman Numbers[J].Guangxi Sciences,2006,13(4):249-252.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 339次   下载 274 本文二维码信息
码上扫一扫!
关于顶点Folkman数的新不等式
许晓东1, 罗海鹏1, 苏文龙2, 吴康3
0
(1.广西科学院, 广西南宁 530007;2.梧州学院, 广西梧州 543002;3.华南师范大学数学科学学院, 广东广州 510631)
摘要:
对于无向简单图G及正整数a1,…,ak,记G→(a1,…,ak)v当且仅当对于图G的任意一种顶点k染色,一定对某个i∈{1,…,k}存在顶点全染着颜色i的完全子图Kai.对于p>max{a1,…,ak},定义Fv(a1,…,ak;p)=min{V(G):G→(a1,…,ak)v,KpG}为顶点Folkman数.证明关于顶点Folkman数Fv(k,k;k+1)的新的迭代不等式,并推广Kolev和Nenov的一个关于多色顶点Folkman数的不等式.
关键词:  顶点Folkman数  上界  染色
DOI:
投稿时间:2006-06-06
基金项目:Partially Supported by the National Natural Science Fund of China (60563008).
New Inequalities on Vertex Folkman Numbers
XU Xiao-dong1, LUO Hai-peng1, SU Wen-long2, WU Kang3
(1.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China;2.Wuzhou University, Wuzhou, Guangxi, 543002, China;3.School of Mathematics, South China Normal University, Guangzhou, Guangdong, 510631, China)
Abstract:
For an undirected,simple graph G,and positive integers a1,…,ak,we write G→(a1,…,ak)v if and only if for every vertex k-coloring of G,there exists a monochromatic Kai,for some color i∈{1,…,k}.The vertex Folkman number is defined as Fv(a1,…,ak;p)=min{|V(G)|:G→(a1,…,ak)v,KpG}for p>max{a1,…,ak}.In this paper,new recurrent inequalities on vertex Folkman numbers Fv(k,k;k+1) are proved.We also generalize an inequality of Kolev and Nenov on multicolor Folkman numbers.
Key words:  vertex Folkman number  upper bound  coloring

用微信扫一扫

用微信扫一扫