注意路径的三色二部拉姆齐数

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2021-06-14 DOI:10.1080/23799927.2021.1934900

Ke Wang, Jiannan Zhou, Dong He, Qin Tong

{"title":"注意路径的三色二部拉姆齐数","authors":"Ke Wang, Jiannan Zhou, Dong He, Qin Tong","doi":"10.1080/23799927.2021.1934900","DOIUrl":null,"url":null,"abstract":"For bipartite graphs , the bipartite Ramsey number is the least positive integer p so that any coloring of the edges of with k colors will result in a copy of in the ith color for some i. In this paper, we investigate the appearance of simpler monochromatic graphs such as paths under a 3-colouring of the edges of a bipartite graph. we obtain the exact value of , and for , and for by a new method of proof.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Note on the three-coloured bipartite Ramsey numbers for paths\",\"authors\":\"Ke Wang, Jiannan Zhou, Dong He, Qin Tong\",\"doi\":\"10.1080/23799927.2021.1934900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For bipartite graphs , the bipartite Ramsey number is the least positive integer p so that any coloring of the edges of with k colors will result in a copy of in the ith color for some i. In this paper, we investigate the appearance of simpler monochromatic graphs such as paths under a 3-colouring of the edges of a bipartite graph. we obtain the exact value of , and for , and for by a new method of proof.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2021.1934900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2021.1934900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 2

摘要

对于二部图，二部拉姆齐数是最小的正整数p，因此对其k色边的任何着色都会得到i色边的第i色副本。在本文中，我们研究了更简单的单色图的外观，如二部图边的3色下的路径。通过一种新的证明方法，我们得到了的精确值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Note on the three-coloured bipartite Ramsey numbers for paths

For bipartite graphs , the bipartite Ramsey number is the least positive integer p so that any coloring of the edges of with k colors will result in a copy of in the ith color for some i. In this paper, we investigate the appearance of simpler monochromatic graphs such as paths under a 3-colouring of the edges of a bipartite graph. we obtain the exact value of , and for , and for by a new method of proof.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics

CiteScore

1.80

自引率

0.00%

发文量