Gallai-Ramsey numbers for rainbow S₃^+ and monochromatic paths
From MaRDI portal
Publication:2118232
Recommendations
Cites work
- scientific article; zbMATH DE number 5717204 (Why is no real title available?)
- scientific article; zbMATH DE number 89408 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- Edge colorings of complete graphs without tricolored triangles
- Edge-colored complete graphs with precisely colored subgraphs
- Extensions of Gallai-Ramsey results
- Gallai-Ramsey number for \(K_4\)
- Gallai-Ramsey number of an 8-cycle
- Gallai-Ramsey numbers for cycles
- Gallai-Ramsey numbers of \(C_7\) with multiple colors
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Path-path Ramsey type numbers for the complete bipartite graph
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey Theorems for Multiple Copies of Graphs
- Ramsey-type results for Gallai colorings
- The Erdős-Hajnal conjecture for rainbow triangles
- The Ramsey number for stripes
- Transitiv orientierbare Graphen
Cited in
(10)- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Gallai-Ramsey multiplicity for rainbow small trees
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Complete graphs and complete bipartite graphs without rainbow path
- Extremal problems and results related to Gallai-colorings
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey Number for Rainbow S3
- Gallai-Ramsey numbers for paths
- Extensions of Gallai-Ramsey results
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
This page was built for publication: Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118232)
