A note on (t - 1)-chromatic Ramsey number of linear forests

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS
A. Khamseh
{"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}
引用次数: 2

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.
线性森林(t - 1)色拉姆齐数的注释
给定t种不同的颜色,我们以任意的方式对t−1种颜色的t个子集排序。让我们用图形。表示的-色Ramsey数被定义为最小的数n,如果完全图的边以任意方式用t种颜色着色,则对于某些i,其边用第i种颜色子集着色的子图包含a。本文研究了线性森林的-色拉姆齐数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信