Anti-Ramsey numbers of graphs with small connected components

DOI10.1007/S00373-015-1581-YzbMath1339.05249arXiv1310.4331OpenAlexW3099717275MaRDI QIDQ292266

Shoni Gilboa, Yehuda Roditty

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.4331

zbMATH Keywords

rainbowanti-Ramseymulticoloured

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (6)

Anti-Ramsey Hypergraph Numbers ⋮ On the anti-Ramsey number of forests ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ On the anti-Ramsey numbers of linear forests ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms

Cites Work

• The anti-Ramsey number of perfect matching
• On restricted colourings of \(K_ n\)
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• Anti-Ramsey numbers of small graphs
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems

This page was built for publication: Anti-Ramsey numbers of graphs with small connected components