5阶路径的多色星临界加莱-拉姆齐数

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2023-10-17 DOI:10.47443/dml.2023.115
{"title":"5阶路径的多色星临界加莱-拉姆齐数","authors":"","doi":"10.47443/dml.2023.115","DOIUrl":null,"url":null,"abstract":"In this paper, the t -color star-critical Gallai-Ramsey number for a path of order 5 is determined. It is proved that t +1 edges are both necessary and sufficient to add between a vertex and a critical coloring for the t -color Gallai-Ramsey number for P 5 in order to guarantee the existence of a monochromatic subgraph isomorphic to P 5 . The proof depends on a well-known structural result for Gallai colorings as well as a general lower bound due to Faudree, Gould, Jacobson, and Magnant.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The multicolor star-critical Gallai-Ramsey number for a path of order 5\",\"authors\":\"\",\"doi\":\"10.47443/dml.2023.115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the t -color star-critical Gallai-Ramsey number for a path of order 5 is determined. It is proved that t +1 edges are both necessary and sufficient to add between a vertex and a critical coloring for the t -color Gallai-Ramsey number for P 5 in order to guarantee the existence of a monochromatic subgraph isomorphic to P 5 . The proof depends on a well-known structural result for Gallai colorings as well as a general lower bound due to Faudree, Gould, Jacobson, and Magnant.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The multicolor star-critical Gallai-Ramsey number for a path of order 5
In this paper, the t -color star-critical Gallai-Ramsey number for a path of order 5 is determined. It is proved that t +1 edges are both necessary and sufficient to add between a vertex and a critical coloring for the t -color Gallai-Ramsey number for P 5 in order to guarantee the existence of a monochromatic subgraph isomorphic to P 5 . The proof depends on a well-known structural result for Gallai colorings as well as a general lower bound due to Faudree, Gould, Jacobson, and Magnant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics Letters
Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.50
自引率
12.50%
发文量
47
审稿时长
12 weeks
期刊最新文献
On unicyclic graphs with a given girth and their minimum symmetric division deg index Letters of a given size in Catalan words On the atom-bond sum-connectivity spectral radius of trees Coprime divisors graphs and their coloring parameters Multicolor Ramsey theory for a fan versus complete graphs
×
引用
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