On the anti-Ramsey numbers of linear forests

Tian Ying Xie; Long Tu Yuan

doi:10.1016/j.disc.2020.112130

On the anti-Ramsey numbers of linear forests

Tian Ying Xie
, Long Tu Yuan

School of Mathematical Sciences

School of Mathematical Sciences
University of Science and Technology of China

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

Abstract

For a fixed graph F, the anti-Ramsey number, AR(n,F), is the maximum number of colors in an edge-coloring of K_n which does not contain a rainbow copy of F. In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large n, and show the extremal edge-colored graphs. This answers a question of Fang, Győri, Lu and Xiao.

Original language	English
Article number	112130
Journal	Discrete Mathematics
Volume	343
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2020.112130
State	Published - Dec 2020

Keywords

Anti-Ramsey numbers
Linear forests

Access to Document

10.1016/j.disc.2020.112130

Cite this

@article{8bfb558981144d67bc3a5bbc39cfed76,

title = "On the anti-Ramsey numbers of linear forests",

abstract = "For a fixed graph F, the anti-Ramsey number, AR(n,F), is the maximum number of colors in an edge-coloring of Kn which does not contain a rainbow copy of F. In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large n, and show the extremal edge-colored graphs. This answers a question of Fang, Gy{\H o}ri, Lu and Xiao.",

keywords = "Anti-Ramsey numbers, Linear forests",

author = "Xie, \{Tian Ying\} and Yuan, \{Long Tu\}",

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

year = "2020",

month = dec,

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

language = "英语",

volume = "343",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

T1 - On the anti-Ramsey numbers of linear forests

AU - Xie, Tian Ying

AU - Yuan, Long Tu

PY - 2020/12

Y1 - 2020/12

N2 - For a fixed graph F, the anti-Ramsey number, AR(n,F), is the maximum number of colors in an edge-coloring of Kn which does not contain a rainbow copy of F. In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large n, and show the extremal edge-colored graphs. This answers a question of Fang, Győri, Lu and Xiao.

AB - For a fixed graph F, the anti-Ramsey number, AR(n,F), is the maximum number of colors in an edge-coloring of Kn which does not contain a rainbow copy of F. In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large n, and show the extremal edge-colored graphs. This answers a question of Fang, Győri, Lu and Xiao.

KW - Anti-Ramsey numbers

KW - Linear forests

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

U2 - 10.1016/j.disc.2020.112130

DO - 10.1016/j.disc.2020.112130

M3 - 文章

AN - SCOPUS:85090131621

SN - 0012-365X

VL - 343

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

M1 - 112130

ER -

On the anti-Ramsey numbers of linear forests

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this