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 suﬃcient 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 suﬃcient 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

摘要

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

查看原文本刊更多论文

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 suﬃcient 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 Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks