On the anti-Ramsey numbers of linear forests
Combinatorics
2020-03-18 v1
Abstract
For a fixed graph , the , , is the maximum number of colors in an edge-coloring of which does not contain a rainbow copy of . In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large , and show the extremal edge-colored graphs. This answers a question of Fang, Gy\H{o}ri, Lu and Xiao.
Cite
@article{arxiv.2003.07541,
title = {On the anti-Ramsey numbers of linear forests},
author = {Tian-Ying Xie and Long-Tu Yuan},
journal= {arXiv preprint arXiv:2003.07541},
year = {2020}
}