On the anti-Ramsey number of forests
From MaRDI portal
Publication:2659067
DOI10.1016/j.dam.2020.08.027zbMath1471.05067arXiv1908.04129OpenAlexW3114600156MaRDI QIDQ2659067
Mei Lu, Chunqiu Fang, Ervin Gyoeri, Ji Meng Xiao
Publication date: 25 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04129
Related Items (6)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms
Cites Work
- Unnamed Item
- Anti-Ramsey numbers of graphs with small connected components
- On the Turán number of forests
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- On restricted colourings of \(K_ n\)
- Complete solution for the rainbow numbers of matchings
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- On maximal paths and circuits of graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Anti-Ramsey numbers for disjoint copies of graphs
- On totally multicolored stars
- An anti-Ramsey theorem
This page was built for publication: On the anti-Ramsey number of forests