The Anti-Ramsey Number For Paths
- Speaker
- Long-Tu Yuan
- Affiliation
- East China Normal University
- Date
- Time
- – Asia/Shanghai
- Venue
- Online meeting
Abstract
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a given graph $H$, the anti-Ramsey number $\operatorname{AR}(n,H)$ of $H$ is the maximum number of colors in an edge-colored $K_n$ such that $K_n$ does not contain a copy of rainbow $H$. We determine the exactly anti-Ramsey number for paths. This confirms aconjecture posed by Erdös, Simonovits and Sós in 1970s.
Host
SCMS （上海数学中心）
Online Meeting
ID: 830 305 307 Password: 121323
https://zoom.com.cn/j/8303053077