Recommendations
Cites work
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Asymptotic Size Ramsey Results for Bipartite Graphs
- Edge colorings of complete graphs without tricolored triangles
- Gallai-Ramsey number for the union of stars
- Gallai-Ramsey numbers for fans
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai–Ramsey number for K5 ${K}_{5}$
- scientific article; zbMATH DE number 3896977 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Lambda composition
- On size Ramsey number of paths, trees, and circuits. I
- On the size-Ramsey number of tight paths
- On-line Ramsey Numbers
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey and Gallai-Ramsey number for wheels
- Ramsey-type results for Gallai colorings
- Remarks on the size Ramsey number of graphs
- Size Ramsey numbers for small‐order graphs
- Size Ramsey numbers involving stars
- Small Ramsey numbers
- The size Ramsey number
- The size Ramsey number of short subdivisions of bounded degree graphs
- The size-Ramsey number of trees
- Transitiv orientierbare Graphen
Cited in
(3)
This page was built for publication: Size Gallai-Ramsey number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143692)
