线性森林(t - 1)色拉姆齐数的注释

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2020-04-02 DOI:10.1080/23799927.2020.1761886

A. Khamseh

{"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}

引用次数: 2

摘要

给定t种不同的颜色，我们以任意的方式对t−1种颜色的t个子集排序。让我们用图形。表示的-色Ramsey数被定义为最小的数n，如果完全图的边以任意方式用t种颜色着色，则对于某些i，其边用第i种颜色子集着色的子图包含a。本文研究了线性森林的-色拉姆齐数。

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

查看原文本刊更多论文

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.

求助全文

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

来源期刊

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

CiteScore

1.80

自引率

0.00%

发文量