期刊文献+

顶点Folkman数的上界(英文)

On the Upper Bounds for Vertex Folkman Numbers
下载PDF
导出
摘要 证明关于顶点Folkman数上界的新不等式.特别地,用构造性方法证明:对于任意满足0<r<1/2log23-3/4的实数r,存在N(r)>0和c(r)>0使得Fv(k,k;k+1)≤c(r)(k-1)1/4log2(k-1)-r对任意的k≥N(r)成立,其中N(r)和c(r)都是只依赖于r的常数. Abstract:Some new inequalities on the upper bounds for vertex Folkman numbers are proven in this paper. In particular,we prove the following result by constructive method:for any real number r that satisfies 0〈r〈1/2log;3-3/4,there are(r)〉0 and c(r)〉0 such that Fv(k,k;k+1)≤c(r)(k-1)^1/4log2(k-1)-rfor any k≥N(r),in which both N(r) and c(r) are constants only depending on r.
出处 《广西科学》 CAS 2008年第3期211-215,共5页 Guangxi Sciences
基金 the National Natural Science Fund of China(60563008) the Basic Research Fund of Guangxi Academy of Sciences(080414)
关键词 顶点Folkman数 上界 合成图 vertex Folkman number, upper bound,composition
  • 相关文献

参考文献10

  • 1Folkman J. Graphs with monochromatic complete subgraphs in every edge coloring[J].SIAM J Appl Math, 1970(18) : 19-24.
  • 2Nesetril J and Rodl V. The Ramsey property for graphs with Forbidden complete subgraphs [J ]. J Combin Theory Ser B, 1976(20): 243-249.
  • 3Graham R L,Rothschild B L,Spencer J H. Ramsey theory[M]. New York :Wiley, 1980.
  • 4Nenov N. Application of the corona-product of two graphs in Ramsey theory[J]. Annuaire Univ Sofia Fac Math Inform, 1985,79 : 349-355.
  • 5Luezak T, Ruei fiski A,Urba fiski S. On minimal Folkman graphs[J]. Discrete Math, 2001,236 : 245-262.
  • 6Nenov N. Extremal problems of graph colorings [M]. Sofia : Dr Sci Thesis, Sofia Univ, 2005.
  • 7许晓东,罗海鹏,苏文龙,吴康.关于顶点Folkman数的新不等式(英文)[J].广西科学,2006,13(4):249-252. 被引量:1
  • 8Bondy J A,Murty U S R. Graph theory and applications[M]. London : Macmillan, 1976.
  • 9Kolev N. A multiplicative inequality for vertex Folkman numbers[J]. Discrete Mathematics, article in press, 2008,308(8) : 4263-4266.
  • 10Dudek A and Rodl V. New upper bound on vertex Folkman numbers[J].To Appear in Lecture Notes in Computer Science 4957,2008 : 473-478.

二级参考文献11

  • 1FOLKMAN J.Graphs with monochromatic complete subgraphs in every edge coloring[J].SIAM J Appl Math,1970(18):19-24.
  • 2NEETIL J,R O″DL V.The Ramsey property for graphs with forbidden complete subgraphs[J].Journal of Combinatorial Theory:Series B,1976(20):243-249.
  • 3GRAHAM R L,ROTHSCHILD B L,SPENCER J H.Ramsey theory[M].New York:John Wiley & Sons Inc,1980.
  • 4NENOV N.Application of the corona-product of two graphs in Ramsey theory[J].Annuaire Univ Sofia Fac Math Inform,1985(79):349-355.
  • 5(L)UCZAK T,RUCI N'SKI A,URBA N'SKI S,On minimal Folkman graphs[J].Discrete Mathematics,2001(236):245-262.
  • 6NENOV N.Extremal problems of graph colorings[C].Dr Sci Thesis,Sofia Univ,Sofia,2005.
  • 7NENOV N.On a class of vertex Folkman graphs[J].Annuaire Univ Sofia Fac Math Inform,2000(94):15-25.
  • 8KOLEV N,NENOV N.New Recurrent inequality on a class of vertex Folkman numbers[C/OL].arXiv:Math CO/0603296v1,2006-03-13.
  • 9XU XIAODONG.On the upper bounds for vertex Folkman numbers.In preparing.
  • 10PIWAKOWSKI K,RADZISZOWSKI S P,URBA N′SKI S.Computation of the Folkman number Fe(3;3;5)[J].J Graph Theory,1999(32):41-49.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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