Anti-Ramsey numbers for vertex-disjoint triangles
From MaRDI portal
Publication:2092342
DOI10.1016/j.disc.2022.113123zbMath1502.05161arXiv2201.03424OpenAlexW4225922078MaRDI QIDQ2092342
Fangfang Wu, Ji Meng Xiao, Sheng Gui Zhang, Bin Long Li
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.03424
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- On the maximal number of independent triangles in graphs
- On the maximum number of independent cycles in a graph
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey numbers for graphs with independent cycles
- An anti-Ramsey theorem on cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- An anti-Ramsey theorem
This page was built for publication: Anti-Ramsey numbers for vertex-disjoint triangles