Anti-Ramsey number of triangles in complete multipartite graphs
From MaRDI portal
Publication:2045396
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
Cites work
- An anti-Ramsey theorem on cycles
- Anti-Ramsey numbers for graphs with independent cycles
- Anti-Ramsey numbers in complete split graphs
- Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
- Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Bipartite anti-Ramsey numbers of cycles
- scientific article; zbMATH DE number 3494450 (Why is no real title available?)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- 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
- Planar anti-Ramsey numbers of paths and cycles
- Rainbow generalizations of Ramsey theory: A survey
- Rainbow numbers for cycles in plane triangulations
- Rainbow numbers for cycles with pendant edges
- Rainbow triangles in edge-colored Kneser graphs
Cited in
(16)- Rainbow matchings in edge-colored complete split graphs
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Anti-Ramsey numbers in complete k-partite graphs
- Anti-Ramsey numbers for vertex-disjoint triangles
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey number of matchings in a hypergraph
- Rainbow triangles in edge-colored Kneser 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
- Turán numbers and anti-Ramsey numbers for short cycles in complete 3-partite graphs
- The anti-Ramsey problem for independent triangles in tripartite graphs.
- Two extremal problems for 4-cycles in 4-partite graphs
- Rainbow independent triangles in complete split graphs
- Rainbow multipartite C₄ in 4-partite graphs
- Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
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)
