Anti-Ramsey numbers for vertex-disjoint triangles

Fangfang Wu; Shenggui Zhang; Binlong Li; Jimeng Xiao

doi:10.1016/j.disc.2022.113123

Anti-Ramsey numbers for vertex-disjoint triangles

Fangfang Wu
, Shenggui Zhang
, Binlong Li
, Jimeng Xiao

数学与统计学院

Northwestern Polytechnical University Xian

科研成果: 期刊稿件 › 文章 › 同行评审

9 引用（Scopus）

摘要

An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of K_n with no rainbow copy of G. Denote by kC₃ the union of k vertex-disjoint copies of C₃. In this paper, we determine the anti-Ramsey number ar(n,kC₃) for n=3k and n≥2k²−k+2, respectively. When 3k≤n≤2k²−k+2, we give lower and upper bounds for ar(n,kC₃).

源语言	英语
文章编号	113123
期刊	Discrete Mathematics
卷	346
期	1
DOI	https://doi.org/10.1016/j.disc.2022.113123
出版状态	已出版 - 1月 2023

访问文件

10.1016/j.disc.2022.113123

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{b3121b8591b04feb96ae7b6b8e8b11fe,

title = "Anti-Ramsey numbers for vertex-disjoint triangles",

abstract = "An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of G. Denote by kC3 the union of k vertex-disjoint copies of C3. In this paper, we determine the anti-Ramsey number ar(n,kC3) for n=3k and n≥2k2−k+2, respectively. When 3k≤n≤2k2−k+2, we give lower and upper bounds for ar(n,kC3).",

keywords = "Anti-Ramsey number, Complete graphs, Vertex-disjoint triangles",

author = "Fangfang Wu and Shenggui Zhang and Binlong Li and Jimeng Xiao",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2023",

month = jan,

doi = "10.1016/j.disc.2022.113123",

language = "英语",

volume = "346",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Anti-Ramsey numbers for vertex-disjoint triangles

AU - Wu, Fangfang

AU - Zhang, Shenggui

AU - Li, Binlong

AU - Xiao, Jimeng

PY - 2023/1

Y1 - 2023/1

N2 - An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of G. Denote by kC3 the union of k vertex-disjoint copies of C3. In this paper, we determine the anti-Ramsey number ar(n,kC3) for n=3k and n≥2k2−k+2, respectively. When 3k≤n≤2k2−k+2, we give lower and upper bounds for ar(n,kC3).

AB - An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of G. Denote by kC3 the union of k vertex-disjoint copies of C3. In this paper, we determine the anti-Ramsey number ar(n,kC3) for n=3k and n≥2k2−k+2, respectively. When 3k≤n≤2k2−k+2, we give lower and upper bounds for ar(n,kC3).

KW - Anti-Ramsey number

KW - Complete graphs

KW - Vertex-disjoint triangles

UR - https://www.scopus.com/pages/publications/85136074470

U2 - 10.1016/j.disc.2022.113123

DO - 10.1016/j.disc.2022.113123

M3 - 文章

AN - SCOPUS:85136074470

SN - 0012-365X

VL - 346

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

M1 - 113123

ER -

Anti-Ramsey numbers for vertex-disjoint triangles

摘要

访问文件

其它文件与链接

指纹

引用此