Preprint
Aug 2026
Anti-Ramsey Number for Suspension of Edge-Critical Graphs
An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The \textit{anti-Ramsey number}, denoted by $\ar(n,F),$ for a fixed graph $F$ and a positive integer $n$, is the maximum number of colors used in an edge-coloring of the complete graph $K_n$ that contains no rainbow copy of $F$. Mean...
Shu-Chao Li, Hao Zheng
· 0 citations