2 papers
math.CO2025
On Neutral Edge Sets in Anti-Ramsey Numbers
Ali Ghalavand, Qing Jie, Zemin Jin +2
The anti-Ramsey number of a graph , introduced by ErdÅs et al.\ in 1975, is the maximum number of colors in an edge-coloring of the complete graph that avoids a rainbow c…
math.CO2025
On the Anti-Ramsey Number Under Edge Deletion
Ali Ghalavand, Qing Jie, Zemin Jin +2
According to a study by ErdÅs et al. in 1975, the anti-Ramsey number of a graph \(G\), denoted as \(AR(n, G)\), is defined as the maximum number of colors that can be used in an e…