The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
From MaRDI portal
Publication:1981664
DOI10.1016/j.disc.2021.112540zbMath1472.05109arXiv2007.06003OpenAlexW3187063184MaRDI QIDQ1981664
Chunqiu Fang, Ji Meng Xiao, Ervin Gyoeri, Bin Long Li
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.06003
Related Items (2)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anti-Ramsey numbers in complete split graphs
- Anti-Ramsey numbers of graphs with small connected components
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- Rainbows in the hypercube
- 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 matchings in edge-colored complete split graphs
- Rainbow numbers for matchings and complete graphs
- Planar anti-Ramsey numbers of paths and cycles
- Planar anti-Ramsey numbers of matchings
- An anti-Ramsey theorem on cycles
- On the anti-Ramsey number of forests
- Bipartite anti-Ramsey numbers of cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Rainbow Numbers for Cycles in Plane Triangulations
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- An anti-Ramsey theorem
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
This page was built for publication: The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
