Anti-Ramsey numbers for graphs with independent cycles

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/227017, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r85.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

anti Ramsey number rainbow graphs two independent cycles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Review text

Summary: An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let \({\mathcal G}\) be a family of graphs. The anti-Ramsey number \(\text{AR}(n,{\mathcal G})\) for \({\mathcal G}\), introduced by Erdős et al., is the maximum number of colors in an edge coloring of \(K_n\) that has no rainbow copy of any graph in \({\mathcal G}\). In this paper, we determine the anti-Ramsey number \(\text{AR}(n,\Omega_2)\), where \(\Omega_2\) denotes the family of graphs that contain two independent cycles.

Recommendations

Cited in

(27)

This page was built for publication: Anti-Ramsey numbers for graphs with independent cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380240)