Anti-Ramsey number of triangles in complete multipartite graphs
From MaRDI portal
Publication:2045396
DOI10.1007/s00373-021-02302-zzbMath1470.05113OpenAlexW3141053891MaRDI QIDQ2045396
Publication date: 12 August 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02302-z
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (2)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Anti-Ramsey number of matchings in a hypergraph
Cites Work
- Unnamed Item
- Anti-Ramsey numbers in complete split graphs
- Rainbow generalizations of Ramsey theory: A survey
- Rainbow numbers for cycles with pendant edges
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Rainbow triangles in edge-colored Kneser graphs
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Anti-Ramsey numbers for graphs with independent cycles
- An anti-Ramsey theorem on cycles
- Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
- Bipartite anti-Ramsey numbers of 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
- Rainbow Numbers for Cycles in Plane Triangulations
This page was built for publication: Anti-Ramsey number of triangles in complete multipartite graphs
