On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
From MaRDI portal
Publication:4655902
DOI10.1017/S096354830300590XzbMath1063.05100OpenAlexW2034225398WikidataQ123344793 ScholiaQ123344793MaRDI QIDQ4655902
Publication date: 8 March 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354830300590x
Related Items (36)
Bipartite anti-Ramsey numbers of cycles ⋮ Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Rainbow numbers for matchings and complete graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Some heterochromatic theorems for matroids ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Maximum face-constrained coloring of plane graphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Avoiding rainbow 2-connected subgraphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ Unnamed Item ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Anti-Ramsey numbers of subdivided graphs ⋮ Rainbow numbers for certain graphs
This page was built for publication: On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
