Rainbow numbers for graphs containing small cycles

DOI10.1007/s00373-015-1577-7zbMath1327.05178OpenAlexW2076672288MaRDI QIDQ897256

Roman Soták, Ingo Schiermeyer

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1577-7

zbMATH Keywords

Turán numberrainbow numberanti-Ramsey numberrainbow colouring

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Generalized Ramsey theory (05C55)

Related Items

Anti-Ramsey numbers in complete split graphs, Anti-Ramsey numbers for disjoint copies of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• An anti-Ramsey theorem on diamonds
• Rainbow numbers for cycles with pendant edges
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• Graph Theory and Probability
• An anti-Ramsey theorem