{"title":"线性森林(t - 1)色拉姆齐数的注释","authors":"A. Khamseh","doi":"10.1080/23799927.2020.1761886","DOIUrl":null,"url":null,"abstract":"Given t distinct colors, we order the t subsets of t−1 colors in some arbitrary manner. Let be graphs. The -chromatic Ramsey number, denoted by , is defined to be the least number n such that if the edges of the complete graph are colored in any fashion with t colors, then for some i the subgraph whose edges are colored with the ith subset of colors contains a . In this paper, we study the -chromatic Ramsey number of linear forests.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A note on (t - 1)-chromatic Ramsey number of linear forests\",\"authors\":\"A. Khamseh\",\"doi\":\"10.1080/23799927.2020.1761886\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given t distinct colors, we order the t subsets of t−1 colors in some arbitrary manner. Let be graphs. The -chromatic Ramsey number, denoted by , is defined to be the least number n such that if the edges of the complete graph are colored in any fashion with t colors, then for some i the subgraph whose edges are colored with the ith subset of colors contains a . In this paper, we study the -chromatic Ramsey number of linear forests.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-04-02\",\"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.2020.1761886\",\"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.2020.1761886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
A note on (t - 1)-chromatic Ramsey number of linear forests
Given t distinct colors, we order the t subsets of t−1 colors in some arbitrary manner. Let be graphs. The -chromatic Ramsey number, denoted by , is defined to be the least number n such that if the edges of the complete graph are colored in any fashion with t colors, then for some i the subgraph whose edges are colored with the ith subset of colors contains a . In this paper, we study the -chromatic Ramsey number of linear forests.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
