Anti-Ramsey number of triangles in complete multipartite graphs
From MaRDI portal
Publication:2045396
DOI10.1007/S00373-021-02302-ZzbMATH Open1470.05113OpenAlexW3141053891MaRDI QIDQ2045396FDOQ2045396
Authors: Yanyan Li 
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
Recommendations
- Anti-Ramsey numbers for vertex-disjoint triangles
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- Anti-Ramsey numbers in complete split graphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- scientific article; zbMATH DE number 2192153
- On bounds for size Ramsey numbers of a complete tripartite graph
- Anti-Ramsey theory on complete bipartite graphs
- The anti-Ramsey threshold of complete graphs
- Ramsey numbers and triangle-free Cayley graphs
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Rainbow numbers for cycles with pendant edges
- An anti-Ramsey theorem on cycles
- Anti-Ramsey numbers in complete split graphs
- Bipartite anti-Ramsey numbers of cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Title not available (Why is that?)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow Numbers for Cycles in Plane Triangulations
- Rainbow generalizations of Ramsey theory: A survey
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
- Anti-Ramsey numbers for graphs with independent cycles
- Planar anti-Ramsey numbers of paths and cycles
- Rainbow triangles in edge-colored Kneser graphs
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
Cited In (5)
- Computing the anti-Ramsey number for trees in complete tripartite graph
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey number of matchings in a hypergraph
This page was built for publication: Anti-Ramsey number of triangles in complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045396)
