全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Ramsey Numbers for Theta Graphs

DOI: 10.1155/2011/649687

Full-Text   Cite this paper   Add to My Lib

Abstract:

The graph Ramsey number (1,2) is the smallest integer with the property that any complete graph of at least vertices whose edges are colored with two colors (say, red and blue) contains either a subgraph isomorphic to 1 all of whose edges are red or a subgraph isomorphic to 2 all of whose edges are blue. In this paper, we consider the Ramsey numbers for theta graphs. We determine (4,), (5,) for ≥4. More specifically, we establish that (4,)=(5,)=2?1 for ≥7. Furthermore, we determine (,) for ≥5. In fact, we establish that (,)=(3/2)?1 if is even, 2?1 if is odd.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133