The paper states ar(n,F_{k+1,r}) = ex(n,F_{k,r}) + 2 for large n, but the proof is incomplete as written.
Anti-Ramsey numbers of graphs with some decomposition family sequences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
For a given graph $H$, the anti-Ramsey number of $H$ is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of $H$. In this paper, we extend the decomposition family of graphs to the decomposition family sequence of graphs and show that $K_5$ is determined by its decomposition family sequence. Based on this new graph notation, we determine the anti-Ramsey numbers for new families of graphs, including the Petersen graph, vertex-disjoint union of cliques, etc., and characterize the extremal colorings.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Anti-Ramsey number of intersecting cliques
The paper states ar(n,F_{k+1,r}) = ex(n,F_{k,r}) + 2 for large n, but the proof is incomplete as written.