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

DOI10.1016/J.DISC.2022.113100zbMath1497.05174arXiv2107.13196OpenAlexW4365787618MaRDI QIDQ2675857

Meiqiao Zhang, Fengming Dong

Publication date: 26 September 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

rainbowtreeedge coloringanti-Ramsey numbercomplete multi-partite graph

Mathematics Subject Classification ID

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

Related Items (2)

Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Computing the anti-Ramsey number for trees in complete tripartite graph

Cites Work

• Unnamed Item
• Edge-colorings of complete graphs that avoid polychromatic trees
• On the anti-Ramsey numbers of linear forests
• Anti-Ramsey numbers in complete \(k\)-partite graphs
• Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
• Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees

This page was built for publication: Anti-Ramsey numbers for trees in complete multi-partite graphs