Anti-Ramsey numbers in complete \(k\)-partite graphs

DOI10.1155/2020/5136104zbMath1459.05198OpenAlexW3083432311MaRDI QIDQ2007338

Jili Ding, Haizheng Yu, Hong Bian

Publication date: 13 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5136104

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

Anti-Ramsey numbers for trees in complete multi-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow numbers for matchings in plane triangulations
• The anti-Ramsey number of perfect matching
• Rainbows in the hypercube
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Edge-colorings with no large polychromatic stars
• Planar anti-Ramsey numbers of paths and cycles
• Anti-Ramsey numbers for graphs with independent cycles
• An anti-Ramsey theorem on cycles
• Bipartite anti-Ramsey numbers of cycles
• Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs

This page was built for publication: Anti-Ramsey numbers in complete \(k\)-partite graphs