On the anti-Ramsey numbers of linear forests

DOI10.1016/j.disc.2020.112130zbMath1448.05205arXiv2003.07541OpenAlexW3083723570MaRDI QIDQ2005724

Yanyan Li

Publication date: 8 October 2020

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

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

zbMATH Keywords

linear forestsanti-Ramsey numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (4)

Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Anti-Ramsey numbers for trees in complete multi-partite graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Anti-Ramsey number of matchings in a hypergraph

Cites Work

• Anti-Ramsey numbers of graphs with small connected components
• On the Turán number of forests
• Rainbow generalizations of Ramsey theory: A survey
• On restricted colourings of \(K_ n\)
• Complete solution for the rainbow numbers of matchings
• Rainbow numbers for matchings and complete graphs
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• Unnamed Item

This page was built for publication: On the anti-Ramsey numbers of linear forests