Speaker:
Long-Tu Yuan (East China Normal University)
Time:
- 13:00 – 14:00 (Time in Beijing)
- March 18, 2021 (Thursday)
Address:
Online meeting
Host:
SCMS （上海数学中心）
VooVmeeting:
ID: 830 305 307 Password: 121323
Link:
https://zoom.com.cn/j/8303053077
Abstract:
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a given graph 𝐻, the anti-Ramsey number AR(𝑛,𝐻) of 𝐻 is the maximum number of colors in an edge-colored 𝐾𝑛 such that 𝐾𝑛 does not contain a copy of rainbow 𝐻. We determine the exactly anti-Ramsey number for paths. This confirms aconjecture posed by Erdös, Simonovits and Sós in 1970s.