{"title":"The Bipartite Ramsey Numbers b(C2m; C2n)","authors":"Rui Zhang, Yongqi Sun, A. Wu","doi":"10.5281/ZENODO.1335404","DOIUrl":null,"url":null,"abstract":"Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b, either G contains a copy of H1 or its complement relative to Kb,b contains a copy of H2. It is known that b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14 and b(K3,3;K3,3) = 17. In this paper we study the case that both H1 and H2 are even cycles, prove that b(C2m;C2n) ≥ m + n − 1 for m = n, and b(C2m;C6) = m+ 2 for m ≥ 4. Keywords—bipartite graph; Ramsey number; even cycle","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"1 1","pages":"152-155"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.1335404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b, either G contains a copy of H1 or its complement relative to Kb,b contains a copy of H2. It is known that b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14 and b(K3,3;K3,3) = 17. In this paper we study the case that both H1 and H2 are even cycles, prove that b(C2m;C2n) ≥ m + n − 1 for m = n, and b(C2m;C6) = m+ 2 for m ≥ 4. Keywords—bipartite graph; Ramsey number; even cycle
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二分拉姆齐数b(C2m);C2n)
给定二部图H1和H2,二部拉姆齐数b(H1;H2)是最小的整数b,使得完全二部图Kb,b的任何子图G, G包含H1的副本或其相对于Kb的补,b包含H2的副本。已知b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14, b(K3,3;K3,3) = 17。本文研究了H1和H2都是偶环的情况,证明了当m = n时b(C2m;C2n)≥m+ n - 1,当m≥4时b(C2m;C6) = m+ 2。Keywords-bipartite图;拉姆齐数量;即使是周期
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Deployment of Beyond 4G Wireless Communication Networks with Carrier Aggregation Evaluation of Colour Perception in Different Correlated Colour Temperature of LED Lighting Drugstore Control System Design and Realization Based on Programmable Logic Controller (PLC) Moment Estimators of the Parameters of Zero-One Inflated Negative Binomial Distribution An Implicit Methodology for the Numerical Modeling of Locally Inextensible Membranes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1