首页 | 本学科首页   官方微博 | 高级检索  
     


Ramsey numbers for a disjoint union of good graphs
Authors:Halina Bielak
Affiliation:Institute of Mathematics, UMCS, Lublin, Poland
Abstract:We give the Ramsey number for a disjoint union of some G-good graphs versus a graph G generalizing the results of Stahl (1975) [5] and Baskoro et al. (2006) [1] and the previous result of the author Bielak (2009) [2]. Moreover, a family of G-good graphs with s(G)>1 is presented.
Keywords:Complete graph   Forest     mmlsi5"   onclick="  submitCitation('/science?_ob=MathURL&  _method=retrieve&  _eid=1-s2.0-S0012365X09006001&  _mathId=si5.gif&  _pii=S0012365X09006001&  _issn=0012365X&  _acct=C000069490&  _version=1&  _userid=6211566&  md5=2bc1903df0e7e3ae5d8cc895090670b9')"   style="  cursor:pointer  "   alt="  Click to view the MathML source"   title="  Click to view the MathML source"  >  formulatext"   title="  click to view the MathML source"  >G-good graph   Ramsey number   Tree
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号