Gallai-Ramsey numbers for rainbow S₃^+ and monochromatic paths
From MaRDI portal
Publication:2118232
DOI10.7151/DMGT.2310zbMATH Open1491.05086OpenAlexW3011744157MaRDI QIDQ2118232FDOQ2118232
Authors: Xihe Li, Ligong Wang 
Publication date: 22 March 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2310
Recommendations
Cites Work
- Title not available (Why is that?)
- Transitiv orientierbare Graphen
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey Theorems for Multiple Copies of Graphs
- Ramsey-type results for Gallai colorings
- Edge colorings of complete graphs without tricolored triangles
- Title not available (Why is that?)
- Extensions of Gallai-Ramsey results
- The Ramsey number for stripes
- Title not available (Why is that?)
- Gallai-Ramsey numbers for cycles
- Edge-colored complete graphs with precisely colored subgraphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Gallai-Ramsey number for \(K_4\)
- Gallai-Ramsey number of an 8-cycle
- Path-path Ramsey type numbers for the complete bipartite graph
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Gallai-Ramsey numbers of \(C_7\) with multiple colors
Cited In (10)
- Complete graphs and complete bipartite graphs without rainbow path
- Gallai-Ramsey numbers for rainbow paths
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Gallai-Ramsey Number for Rainbow S3
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Gallai-Ramsey multiplicity for rainbow small trees
- Extensions of Gallai-Ramsey results
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
- Gallai-Ramsey numbers for paths
- Extremal problems and results related to Gallai-colorings
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)
