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őri, Lu and Xiao.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.